Dominating Cartesian products of cycles
From MaRDI portal
A set of vertices \(D\) in a graph is dominating if every vertex of the graph is adjacent to some vertex from \(D\). The domination number of the graph is the size of a smallest dominating set. The paper discusses the computation of the domination number of Cartesian products of graphs and an algorithm for finding minimum dominating sets in such graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 3902703 (Why is no real title available?)
- scientific article; zbMATH DE number 21746 (Why is no real title available?)
- scientific article; zbMATH DE number 140092 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 1396705 (Why is no real title available?)
- scientific article; zbMATH DE number 975402 (Why is no real title available?)
- Introduction to ``Topics on Domination
- On the domination of the products of graphs II: Trees
- The domination numbers of the 5 × n and 6 × n grid graphs
- Unit disk graphs
Cited in
(48)- On the domination number of generalized petersen graphs \(P(n,2)\)
- Domination number of the cross product of paths
- On domination numbers of Cartesian products of paths
- Total domination number of grid graphs
- The domination complexity and related extremal values of large 3D torus
- Algebraic approach to fasciagraphs and rotagraphs
- On a Vizing-like conjecture for direct product graphs
- Domination number of Cartesian products of directed cycles
- On bondage numbers of graphs: a survey with some comments
- Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
- Number of dominating sets in cylindric square grid graphs
- The secure domination number of Cartesian products of small graphs with paths and cycles
- Total and paired domination numbers of cylinders
- Bounds on the size of the minimum dominating sets of some cylindrical grid graphs
- A general lower bound for the domination number of cylindrical graphs
- The domination number of Cartesian product of two directed paths
- Total and paired domination numbers of toroidal meshes
- 2-rainbow domination number of \(C_n\square C_5\)
- The domination number of \(K_n^3\)
- Bondage number of the discrete torus \(C_n\times C_4\)
- On the independence and domination numbers of replacement product graphs
- Iterative construction of the minimum independent dominating sets in hypercube graphs
- A new method for computing domination polynomials of graphs
- scientific article; zbMATH DE number 2185578 (Why is no real title available?)
- Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\)
- scientific article; zbMATH DE number 3889772 (Why is no real title available?)
- Finding a minimum dominating set by transforming domination of vertices
- scientific article; zbMATH DE number 1339497 (Why is no real title available?)
- scientific article; zbMATH DE number 1510634 (Why is no real title available?)
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
- Dominating sequences in grid-like and toroidal graphs
- Protection of graphs with emphasis on Cartesian product graphs
- The geodetic domination number for the product of graphs
- Domatically perfect graphs
- On the edge geodetic and edge geodetic domination numbers of a graph
- Split domination of Cartesian product graphs
- Smallest independent dominating sets in Kronecker products of cycles
- On domatic and total domatic numbers of Cartesian products of graphs
- EXISTENCE OF LATIN SQUARE DESIGNS ARISING FROM CLASSICAL GRAPH PARAMETERS B. CHALUVARAJU AND SHAIKH AMEER BASHA
- The domination numbers of cylindrical grid graphs
- Bondage number of mesh networks
- The 2-rainbow domination number of Cartesian product of cycles
- Exact dominion of the prism graph: enumeration by congruence class via cyclic words
- On coupon coloring of Cartesian product of some graphs
- On domination numbers of graphs bundles
- Critical cyclic patterns related to the domination number of the torus
- Domination dot-critical graphs with no critical vertices
- On domination number of Cartesian product of directed cycles
This page was built for publication: Dominating Cartesian products of cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1891923)
