Bounds on the hop domination number of a tree

DOI10.1007/s12044-015-0251-6zbMath1327.05254MaRDI QIDQ902254

C. Natarajan, S. K. Ayyaswamy, Balakrishna Krishnakumari, Yanamandram B. Venkatakrishnan

Publication date: 7 January 2016

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12044-015-0251-6

zbMATH Keywords

hop domination

Mathematics Subject Classification ID

05C05: Trees

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

Related Items

An optimal algorithm to find minimum k-hop dominating set of interval graphs, Unnamed Item, An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs, On the complexity of some hop domination parameters, Double hop dominating sets in graphs, Hop domination polynomial of graphs, ON HOP DOMINATION NUMBER OF SOME GENERALIZED GRAPH STRUCTURES, On Hop Roman Domination in Trees, Hop total Roman domination in graphs, On total domination and hop domination in diamond-free graphs, Algorithm and hardness results on hop domination in graphs, On 2-step and hop dominating sets in graphs

Cites Work

• A lower bound on the total outer-independent domination number of a tree
• Lower bound on the domination number of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item