ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES

DOI10.17654/DM026010083zbMath1499.05503OpenAlexW3119162136MaRDI QIDQ5076099

A. Senthil Thilak, S. S. Kamath, Sujatha V. Shet

Publication date: 16 May 2022

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

Full work available at URL: https://doi.org/10.17654/dm026010083

zbMATH Keywords

independent perfect dominationefficient domination2-packingsupport verticesefficient domination numberefficiently dominatable trees

Mathematics Subject Classification ID

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

Cites Work

• The weighted perfect domination problem and its variants
• Perfect codes in graphs
• Lower bound on the domination number of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICES