On a Vizing-like conjecture for direct product graphs

DOI10.1016/0012-365X(96)00032-5zbMath0856.05054WikidataQ123197429 ScholiaQ123197429MaRDI QIDQ1923517

Sandi Klavžar, Blaž Zmazek

Publication date: 30 January 1997

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

zbMATH Keywords

dominating setdomination numberdirect product

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (9)

Connectivity and other invariants of generalized products of graphs ⋮ Unnamed Item ⋮ Dominating direct products of graphs ⋮ Unnamed Item ⋮ The Constant Inapproximability of the Parameterized Dominating Set Problem ⋮ Lower bounds for the domination number and the total domination number of direct product graphs ⋮ Smallest independent dominating sets in Kronecker products of cycles ⋮ Domination-related parameters in rooted product graphs ⋮ Domination number of the cross product of paths

Cites Work

• Dominating Cartesian products of cycles
• On the domination number of cross products of graphs
• On the domination of the products of graphs II: Trees
• Domination, Fractional Domination, 2-Packing, and Graph Products
• The domination numbers of the 5 × n and 6 × n grid graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a Vizing-like conjecture for direct product graphs