On independent \([1, 2]\)-sets in trees

DOI10.7151/dmgt.2029zbMath1391.05191arXiv1511.09262OpenAlexW2963127329MaRDI QIDQ1649903

Sahar A. Aleid, María Luz Puertas, Jose Cáceres

Publication date: 29 June 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

independencedominationspanning treesexcellent trees

Mathematics Subject Classification ID

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

Cites Work

• A linear algorithm for the domination number of a tree
• Optimum domination in weighted trees
• A characterization of \(i\)-excellent trees
• Total domination excellent trees
• \([1,2\)-sets in graphs]
• On the Algorithmic Complexity of Total Domination
• Edge Dominating Sets in Graphs
• R -Domination in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On independent \([1, 2]\)-sets in trees