Lower bounds for the domination number and the total domination number of direct product graphs
DOI10.1016/J.DISC.2010.07.015zbMATH Open1221.05263OpenAlexW2071641257MaRDI QIDQ712256FDOQ712256
Publication date: 28 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.07.015
Recommendations
domination numberdominating settotal dominating settotal domination numbercomplete graphdirect product graphs
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Associative graph products and their independence, domination and coloring numbers
- On the domination number of cross products of graphs
- On a Vizing-like conjecture for direct product graphs
- Dominating direct products of graphs
- Perfect codes in direct products of cycles-a complete characterization
- On the total domination number of cross products of graphs
- Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
- An almost complete description of perfect codes in direct products of cycles
- Title not available (Why is that?)
- Some results on total domination in direct products of graphs
- Idomatic partitions of direct products of complete graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total Domination in Categorical Products of Graphs
- Perfect r-domination in the Kronecker product of three cycles
Cited In (14)
- Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
- On the super connectivity of Kronecker products of graphs
- New results on connected dominating structures in graphs
- On the roman domination in the lexicographic product of graphs
- Connectivity and other invariants of generalized products of graphs
- Classification of rings with unit graphs having domination number less than four
- Tightness of domination inequalities for direct product graphs
- Title not available (Why is that?)
- Domination and upper domination of direct product graphs
- Lower bound for the number of 4-element generating sets of direct products of two neighboring partition lattices
- Domination in direct products of complete graphs
- Domination number of modular product graphs
- Some results on total domination in direct products of graphs
- Unitary Cayley graphs whose Roman domination numbers are at most four
This page was built for publication: Lower bounds for the domination number and the total domination number of direct product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712256)
