Results 1 to 10 of about 4,479 (86)
Secure Total Domination in Rooted Product Graphs
In this article, we obtain general bounds and closed formulas for the secure total domination number of rooted product graphs. The results are expressed in terms of parameters of the factor graphs involved in the rooted product.
Abel Cabrera Martínez +2 more
doaj +3 more sources
Total Roman Domination Number of Rooted Product Graphs
Let G be a graph with no isolated vertex and f:V(G)→{0,1,2} a function. If f satisfies that every vertex in the set {v∈V(G):f(v)=0} is adjacent to at least one vertex in the set {v∈V(G):f(v)=2}, and if the subgraph induced by the set {v∈V(G):f(v)≥1} has ...
Abel Cabrera Martínez +3 more
doaj +3 more sources
On Metric Dimensions of Symmetric Graphs Obtained by Rooted Product
Let G = (V, E) be a connected graph and d(x, y) be the distance between the vertices x and y in G. A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distances to the vertices in W.
Shahid Imran +3 more
doaj +3 more sources
Bounds on the Twin-Width of Product Graphs [PDF]
Twin-width is a graph width parameter recently introduced by Bonnet, Kim, Thomass\'{e} & Watrigant. Given two graphs $G$ and $H$ and a graph product $\star$, we address the question: is the twin-width of $G\star H$ bounded by a function of the twin ...
William Pettersson, John Sylvester
doaj +1 more source
The study of line graphs of subdivision graphs of some rooted product graphs via K-Banhatti indices
The degree-based topological indices are numerical graph invariants that are used to link a molecule’s structural characteristics to its physical, and chemical characteristics.
K. J. Gowtham, N. Narahari
doaj +1 more source
Molecular Descriptors on Line Graphs of Cactus Chains and Rooted Products Graphs
The application of graph theory in the study of molecular physical and chemical properties involves theoretical mathematical chemistry. Atoms, represented by vertices, and edges, represented by bonds between them, are detailed in simple graphs called ...
Iftikhar Ahmad +4 more
doaj +1 more source
Computing Fault-Tolerant Metric Dimension of Connected Graphs
For a connected graph, the concept of metric dimension contributes an important role in computer networking and in the formation of chemical structures.
Uzma Ahmad +3 more
doaj +1 more source
Topological Descriptors on Some Families of Graphs
In view of the successful applications of graph theory, relationships between the biological activity and chemical structure have been developed. One of the popular topics in graph theory is problems relating to topological indices.
Iftikhar Ahmad +3 more
doaj +1 more source
Bounds for the general sum-connectivity index of composite graphs
The general sum-connectivity index is a molecular descriptor defined as χ α ( X ) = ∑ x y ∈ E ( X ) ( d X ( x ) + d X ( y ) ) α $\chi_{\alpha}(X)=\sum_{xy\in E(X)}(d_{X}(x)+d_{X}(y))^{\alpha}$ , where d X ( x ) $d_{X}(x)$ denotes the degree of a vertex x
Shehnaz Akhter +2 more
doaj +1 more source
In this work, we study the degree-based topological invariants, and the general sum-connectivity, A B C 4 , G A 5 , general Zagreb, G A , generalized Randić, and A B C indices of the line graphs of some rooted product ...
Adnan Aslam +4 more
doaj +1 more source

