[1,2]-domination in graphs

DOI10.1016/J.DAM.2014.05.035zbMATH Open1298.05261OpenAlexW2056126213MaRDI QIDQ401141FDOQ401141

Authors: Xiaojing Yang, Baoyindureng Wu 

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

Recommendations

• \((1,2)\)-domination in graphs
• \((1,2)^\ast\)-domination in graphs
• Total \([1,2]\)-domination in graphs
• An introduction to \((1,2)\)-domination graphs
• (1, 2)-DOUBLE DOMINATION IN GRAPHS
• (1, 2)-DOMINATION IN GRAPHS UNDER SOME BINARY OPERATIONS
• \(1/2\)-domination in graphs
• \((2,2)\)-total domination in graphs
• Independent \((1, 2)\)-domination in graphs
• On proper (1,2)‐dominating sets in graphs

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• \([1,2]\)-sets in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quasiperfect domination in triangular lattices
• Two Hamilton cycles in bipartite reflective Kneser graphs
• Title not available (Why is that?)

Cited In (24)

• \([1,k]\)-domination number of lexicographic products of graphs
• [1,2]-Complementary connected domination number of graphs-III
• On the parameterized complexity of \([1,j]\)-domination problems
• An explicit construction of optimal dominating and [1, 2]–dominating sets in grid
• When an optimal dominating set with given constraints exists
• New parameter of inverse domination in graphs
• Total \([1,2]\)-domination in graphs
• \((1,2)\)-domination in graphs
• \((1, j)\)-set problem in graphs
• Title not available (Why is that?)
• Linear programming formulation for some generalized domination parameters
• Quasiperfect domination in trees
• \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms
• [1,2]-Domination in generalized Petersen graphs
• On the Parameterized Complexity of [1,j]-Domination Problems
• Captive domination in graphs
• CTATD number for power graph of some special graphs and tadpole graph
• On the \([1,2]\)-domination number of generalized Petersen graphs
• On perfect and quasiperfect dominations in graphs
• Pitchfork domination in graphs
• Equality co-neighborhood domination in graphs
• (1, 2)-DOMINATION IN GRAPHS UNDER SOME BINARY OPERATIONS
• On \([j, k]\)-sets in graphs
• (1, 2)-DOUBLE DOMINATION IN GRAPHS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401141)