Domination, Fractional Domination, 2-Packing, and Graph Products
From MaRDI portal
Publication:4307055
DOI10.1137/S0895480191217806zbMath0812.05030MaRDI QIDQ4307055
Publication date: 9 May 1995
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Cartesian productgraph productsstrong productdomination number2-packing numberfractional domination number
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (9)
On a Vizing-like conjecture for direct product graphs ⋮ On optimizing edge connectivity of product graphs ⋮ Some results on Vizing's conjecture and related problems ⋮ Fractional Dominating Parameters ⋮ Vizing's conjecture: a survey and recent results ⋮ Minus domination in graphs ⋮ Real and integer domination in graphs ⋮ Linear programming approach for various domination parameters ⋮ Fractional domination of strong direct products
This page was built for publication: Domination, Fractional Domination, 2-Packing, and Graph Products