Results 181 to 190 of about 4,628 (221)
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
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 +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Secure Domination in Rooted Product Graphs
Journal of Combinatorial Optimization, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Juan Alberto Rodriguez-Velazquez +1 more
exaly +3 more sources
Rooted Product and Restricted Rooted Product of Soft Directed Graphs
New Mathematics and Natural Computation, 2023Molodtsov proposed soft set theory as a mathematical framework for handling uncertain data. Nowadays, a lot of people employ soft set theory to solve decision making problems. A graph with directed edges is known as a directed graph. Studying and resolving issues with social networks, shortest paths, electrical circuits, etc.
Jinta Jose +2 more
openaire +2 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