Dominating direct products of graphs
From MaRDI portal
Publication:879339
DOI10.1016/J.DISC.2006.09.013zbMATH Open1116.05055OpenAlexW2062522533MaRDI QIDQ879339FDOQ879339
Authors: Boštjan Brešar, Sandi Klavžar, Douglas F. Rall 
Publication date: 11 May 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.013
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination in graphs
- 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
- Title not available (Why is that?)
- Some results on total domination in direct products of graphs
- Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total Domination in Categorical Products of Graphs
- Smallest independent dominating sets in Kronecker products of cycles
- Domination number of the cross product of paths
- Title not available (Why is that?)
- A note on domination parameters of the conjunction of two special graphs
- Title not available (Why is that?)
Cited In (19)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
- Unimodality and monotonic portions of certain domination polynomials
- Dominating sets in intersection graphs of finite groups
- On the Power Domination Number of Graph Products
- On the roman domination in the lexicographic product of graphs
- Connectivity and other invariants of generalized products of graphs
- Tightness of domination inequalities for direct product graphs
- Domination and upper domination of direct product graphs
- Lower bounds for the domination number and the total domination number of direct product graphs
- Domination in direct products of complete graphs
- On well-dominated graphs
- Domination number of modular product graphs
- On the domination number of cross products of graphs
- Some results on total domination in direct products of graphs
- Domination-related parameters in rooted product graphs
- On independent domination in direct products
- Idomatic partitions of direct products of complete graphs
- Paired Domination in Graphs
This page was built for publication: Dominating direct products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879339)
