\([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms

DOI10.1016/j.dam.2015.06.014zbMath1327.05258arXiv1706.05248OpenAlexW807791927MaRDI QIDQ897596

Mohsen Alambardar Meybodi, Mohammad Reza Hooshmandasl, Amir Kafshdar Goharshady

Publication date: 7 December 2015

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

Full work available at URL: https://arxiv.org/abs/1706.05248

zbMATH Keywords

dominating setstotal dominating sets\([1,2\)-sets]

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

When an optimal dominating set with given constraints exists ⋮ A note on bipartite graphs whose [1,k-domination number equal to their number of vertices] ⋮ Efficient interprocedural data-flow analysis using treedepth and treewidth ⋮ \([1,k\)-domination number of lexicographic products of graphs] ⋮ On the parameterized complexity of \([1,j\)-domination problems] ⋮ An explicit construction of optimal dominating and [1, 2–dominating sets in grid] ⋮ On the Parameterized Complexity of [1,j-Domination Problems]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \([1,2\)-domination in graphs]
• The algorithmic complexity of mixed domination in graphs
• On approximating the minimum independent dominating set
• On domination and independent domination numbers of a graph
• Rainbow domination in graphs
• Hardness results and approximation algorithms for (weighted) paired-domination in graphs
• Complexity of distance paired-domination problem in graphs
• On the mixed domination problem in graphs
• The domination number of Cartesian product of two directed paths
• \([1,2\)-sets in graphs]
• Total domination in graphs
• Minimum independent dominating sets of random cubic graphs
• Total Domination in Graphs

This page was built for publication: \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms