\([1,2]\)-domination in graphs

DOI10.1016/j.dam.2014.05.035zbMath1298.05261OpenAlexW2056126213MaRDI QIDQ401141

Baoyindureng Wu, Xiaojing Yang

Publication date: 26 August 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.035

zbMATH Keywords

dominationrestrained dominationlexicographic product\([1,2\)-sets]Nordhaus-Gaddum

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (20)

Total \([1,2\)-domination in graphs] ⋮ \((1, j)\)-set problem in graphs ⋮ Quasiperfect domination in trees ⋮ Equality co-neighborhood domination in graphs ⋮ [1,2-Complementary connected domination number of graphs-III] ⋮ When an optimal dominating set with given constraints exists ⋮ \([1,2\)-sets and \([1,2]\)-total sets in trees with algorithms] ⋮ On the \([1,2\)-domination number of generalized Petersen graphs] ⋮ \([1,k\)-domination number of lexicographic products of graphs] ⋮ New parameter of inverse domination in graphs ⋮ On the parameterized complexity of \([1,j\)-domination problems] ⋮ An explicit construction of optimal dominating and [1, 2–dominating sets in grid] ⋮ Unnamed Item ⋮ Pitchfork domination in graphs ⋮ On the Parameterized Complexity of [1,j-Domination Problems] ⋮ [1,2-Domination in generalized Petersen graphs] ⋮ On perfect and quasiperfect dominations in graphs ⋮ On \([j, k\)-sets in graphs] ⋮ Captive domination in graphs ⋮ Linear programming formulation for some generalized domination parameters

Cites Work

• Two Hamilton cycles in bipartite reflective Kneser graphs
• \([1,2\)-sets in graphs]
• Quasiperfect domination in triangular lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \([1,2]\)-domination in graphs