Double domination and super domination in trees

DOI10.1142/S1793830916500671zbMath1351.05173OpenAlexW2512973258MaRDI QIDQ5298352

Balakrishna Krishnakumari, Yanamandram B. Venkatakrishnan

Publication date: 14 December 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830916500671

zbMATH Keywords

treedominating setsuper dominating setdouble dominating set

Mathematics Subject Classification ID

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

Related Items (9)

Relating the super domination and 2-domination numbers in cactus graphs ⋮ Computational complexity aspects of super domination ⋮ k-Efficient domination: Algorithmic perspective ⋮ Super domination: graph classes, products and enumeration ⋮ 2-Point set domination in separable graphs ⋮ Total outer connected vertex-edge domination ⋮ Super domination in trees ⋮ Super domination in trees ⋮ On computing secure domination of trees

Cites Work

• Super dominating sets in graphs
• Characterization of double domination subdivision number of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Double domination and super domination in trees