Results 1 to 10 of about 3,063,668 (282)
Secure Total Domination in Rooted Product Graphs
Mathematics, 2020 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 +5 more sources
Total Domination in Rooted Product Graphs [PDF]
Symmetry, 2020 During the last few decades, domination theory has been one of the most active areas of research within graph theory. Currently, there are more than 4400 published papers on domination and related parameters. In the case of total domination, there are over 580 published papers, and 50 of them concern the case of product graphs.
Juan Alberto Rodriguez-Velazquez +2 more
exaly +5 more sources
Total Roman Domination Number of Rooted Product Graphs [PDF]
Mathematics, 2020 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 +5 more sources
On Metric Dimensions of Symmetric Graphs Obtained by Rooted Product
Mathematics, 2018 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 +5 more sources
Double Domination in Rooted Product Graphs
Discrete Applied Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alejandro Estrada-Moreno +1 more
exaly +5 more sources
The Independence Polynomial of Rooted Products of Graphs
Discrete Applied Mathematics, 2010 A stable (or independent) set in a graph is a set of pairwise nonadjacent vertices thereof. The stability number \(\alpha(G)\) is the maximum size of stable sets in a graph \(G\). The independence polynomial of \(G\) is \[ I(G;x) = \sum_{k=0}^{\alpha(G)} s_kx^k= s_0+s_1x+s_2x^2+\cdots+ s_{\alpha(G)} x^{\alpha(G)} \quad (s_0:=1), \] where \(s_k\) is the
exaly +2 more sources
Bounds on the Twin-Width of Product Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 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
International Journal of Mathematics for Industry, 2023 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
Livable human communities: A sustainability narrative [PDF]
Spatium, 2009 This paper will explore the subject of “Livable Human Communities” as the product of “Sustainable Development”, which is rooted in the “Science of Sustainability”. Public policy to facilitate Livable Human Communities will also be examined, with
Cotner Douglas M.
doaj +1 more source
Products of roots of the identity [PDF]
Proceedings of the American Mathematical Society, 2000 It is proved that every invertible bounded linear operator on a complex infinite-dimensional Hilbert space is a product of five n n
Hladnik, M., Omladic, M., Radjavi, H.
openaire +1 more source