The domination complexity and related extremal values of large 3D torus
From MaRDI portal
Publication:1791110
DOI10.1155/2018/3041426zbMath1398.05154OpenAlexW2811269920WikidataQ129575941 ScholiaQ129575941MaRDI QIDQ1791110
Jin Xu, Shaohui Wang, Zehui Shao, Seyyed Mahmoud Sheikholeslami
Publication date: 4 October 2018
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/3041426
Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) ⋮ Hamilton-connectivity of interconnection networks modeled by a product of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the domination number of grid graphs
- On the domination number and the 2-packing number of Fibonacci cubes and Lucas cubes
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Complete characterization of bicyclic graphs with minimal Kirchhoff index
- On the maximum Zagreb indices of graphs with \(k\) cut vertices
- On the domination number of generalized petersen graphs \(P(n,2)\)
- Vertex domination of generalized Petersen graphs
- On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
- Dominating Cartesian products of cycles
- Valency-based topological descriptors of chemical networks and their applications
- On extremal multiplicative Zagreb indices of trees with given domination number
- Sharp bounds of the Zagreb indices of \(k\)-trees
- The domination number of exchanged hypercubes
- The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)
- Total domination and open packing in some chemical graphs
- The Domination Number of Grids
- An updated table of binary/ternary mixed covering codes
- A note on the independent domination number versus the domination number in bipartite graphs
- Domination in Kneser graphs
This page was built for publication: The domination complexity and related extremal values of large 3D torus
