On dominating the Cartesian product of a graph and K2
From MaRDI portal
Publication:4668424
DOI10.7151/dmgt.1238zbMath1063.05107OpenAlexW1967091137MaRDI QIDQ4668424
Douglas F. Rall, Bert L. Hartnell
Publication date: 19 April 2005
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1238
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (31)
Bounds on the 2-rainbow domination number of graphs ⋮ On the domination number of the Cartesian product of the cycle of length \(n\) and any graph ⋮ On minimum identifying codes in some Cartesian product graphs ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ The \(k\)-rainbow bondage number of a graph ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ On domination number of Cartesian product of directed paths ⋮ A note on domination and total domination in prisms ⋮ Domination number of Cartesian products of directed cycles ⋮ Disjunctive total domination in permutation graphs ⋮ The domination number of Cartesian product of two directed paths ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Rainbow domination and related problems on strongly chordal graphs ⋮ Rainbow domination in the lexicographic product of graphs ⋮ 2-rainbow domination number of \(C_n\square C_5\) ⋮ On the 2-rainbow domination in graphs ⋮ 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\) ⋮ On rainbow domination numbers of graphs ⋮ Regular graphs are not universal fixers ⋮ Rainbow domination on trees ⋮ Note on 2-rainbow domination and Roman domination in graphs ⋮ Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph ⋮ On domination number of Cartesian product of directed cycles ⋮ Bounding the \(k\)-rainbow total domination number ⋮ Bipartite graphs are not universal fixers ⋮ Claw-free graphs are not universal fixers ⋮ On the geodetic number of permutation graphs ⋮ Rainbow Domination in Graphs ⋮ On \(k\)-rainbow domination in regular graphs ⋮ Edgeless graphs are the only universal fixers ⋮ On \(k\)-rainbow independent domination in graphs
This page was built for publication: On dominating the Cartesian product of a graph and K2
