Topological indices and domination in graphs are the essential topics in the theory of
graphs. A set of vertices D⊆ V (G) is said to be a dominating set for G if any vertex v∈ VD is …

Chemical graph theory is one of the branches of mathematical chemistry. The importance of
chemical graph theory lies in understanding and explaining the nature of the chemical …

Chemical graph theory is one of the branches of mathematical chemistry. Where chemical
graph theory is important and necessary for a better understanding and interpretation of the …

The chemical structure of a drug is considered as a chemical graph G= V, E, where the
vertex set V is the set of atoms and the edge set E is the set of bonds between the atoms …

Roman domination is one of the many variants of domination that keeps most of the
complexity features of the classical domination problem. We prove that Roman domination …

The concept of Roman domination has recently been studied concerning enumerating and
counting (WG 2022). It has been shown that minimal Roman dominating functions can be …

Tuberculosis (TB) is a global health concern caused by the bacterium Mycobacterium
tuberculosis. This infectious disease primarily affects the lungs but can also impact other …

The minimum dominating set (MDS) problem is a fundamental subject of theoretical
computer science, and has found vast applications in different areas, including sensor …

The Apollonian networks display the remarkable power-law and small-world properties as
observed in most realistic networked systems. Their dual graphs are extended Tower of …

The maximum number of minimal dominating sets in a chordal graph on n vertices is known
to be at most 1.6181 n. However, no example of a chordal graph with more than 1.4422 n …