Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs

DOI10.1016/j.disc.2017.05.007zbMath1367.05155OpenAlexW2624687997MaRDI QIDQ2012524

Boštjan Brešar

Publication date: 1 August 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.05.007

zbMATH Keywords

Vizing's conjectureCartesian productdominationClark-Suen bound

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (6)

A new framework to approach Vizing's conjecture ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ A Vizing-type result for semi-total domination ⋮ An improved bound in Vizing's conjecture ⋮ Total domination in generalized prisms and a new domination invariant ⋮ A \(\frac{3}{4}\)-approximation of Vizing's conjecture for claw-free graphs

Cites Work

• An improved inequality related to Vizing's conjecture
• Vizing's conjecture for chordal graphs
• An inequality related to Vizing's conjecture
• Vizing's conjecture: a survey and recent results
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs