Abstract
Two vertices in a graph are said to 2-step dominate each other if they are at distance 2 apart. A set S of vertices in a graph G is a hop dominating set of G if every vertex outside S is 2-step dominated by some vertex of S. The hop domination number, \(\gamma _{h}(G)\), of G is the minimum cardinality of a hop dominating set of G. A set S of vertices in a graph G is a total dominating set of G if every vertex in G is adjacent to at least one vertex of S. The total domination number, \(\gamma _{t}(G)\), of G is the minimum cardinality of a total dominating set of G. It is known that if G is a triangle-free graph, then \(\gamma _{h}(G)\le \gamma _{t}(G)\). But there are connected graphs G for which the difference \(\gamma _{h}(G)-\gamma _{t}(G)\) can be made arbitrarily large. It would be interesting to find other classes of graphs G that satisfy \(\gamma _{h}(G)\le \gamma _{t}(G)\). In this paper, we study the relationship between total domination number and hop domination number in diamond-free graph. We prove that if G is diamond-free graph of order n with the exception of two special graphs, then \(\gamma _{h}(G)- \gamma _{t}(G)\le \frac{n}{6}\). Furthermore, we find two subclasses of diamond-free graphs G that satisfy \(\gamma _{h}(G)\le \gamma _{t}(G)\) and generalize the known result.
Similar content being viewed by others
References
Ayyaswamy, S.K., Krishnakumari, B., Natarajan, C., Venkatakrishnan, Y.B.: Bounds on the hop domination number of a tree. In: Proceedings of Mathematical Sciences, Indian Academy of Science. https://doi.org/10.1007/s12044-015-0251-6 (2015)
Ayyaswamy, S.K., Natarajan, C.: Hop domination in graphs, (manuscript)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker Inc, New York (1998)
Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker Inc, New York (1998)
Henning, M.A., Rad, N.J.: On \(2\)-step and hop dominating sets in graphs. Graphs Comb. 33, 913–927 (2017)
Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer Monographs in Mathematics. Springer, New York (2013)
Natarajan, C., Ayyaswamy, S.K.: Hop domination in graphs-II. An. St. Univ. Ovidius Constanta 23(2), 187–199 (2015)
Acknowledgements
We are very grateful to the anonymous referees for their helpful remarks and suggestions that highly contributed to improve the quality and presentation of the work.
Author information
Authors and Affiliations
Corresponding author
Additional information
Xueliang Li.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Chen, Xg., Wang, Yf. On Total Domination and Hop Domination in Diamond-Free Graphs. Bull. Malays. Math. Sci. Soc. 43, 1885–1891 (2020). https://doi.org/10.1007/s40840-019-00778-w
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40840-019-00778-w