The Steiner hop domination number of special graphs

Articles in Press

Document Type : Research Paper

Authors

1 Department of Mathematics, Scott Christian College (Autonomous), Nagercoil. Manonmaniam Sundaranar University, Tirunelveli, Tamil Nadu.

2 Department of Mathematics, Scott Christian College (Autonomous),Tamil Nadu, India.

Abstract

The main aim of this article is that the distance-based parameters, in particularly the Steiner concept and the hop domination combine to form interesting results in graph theory. A subset W of vertices in a graph G is called the Steiner hop dominating set of G if W is both a Steiner set and a hop dominating set of G. The minimum cardinality of a Steiner hop dominating set of G is its Steiner hop domination number γhs (G). The Steiner hop domination number of some special graphs, such as the middle graph and degree splitting graph of standard graphs are determined. Also, it is determined for lollipop graph, Barbell graph and pop barbell graph

Keywords

Main Subjects

References

[1] D. Abisha and S. Chandra Kumar, The forcing Steiner hop domination number of a graph, Intelligent systems and applications in engineering, 12 (22s) (2024), 2411-2415.
[2] P. Agasthi, N. Parvathi and K.T. Thirusangu, On Some labeling of line graph of Barbell graph, Inter national Journal of Pure and Applied Mathematics, 113 (10) (2017), 148-156.
[3] D. Anusha, J. John and S. Joseph Robin, Graphs with small and large hop domination numbers, Bulletin of the international mathematical virtual institute, 11 (3) (2021), 483-480.
[4] D. Anusha, S. Joseph Robin and J. John, Further results on the hop domination number of a graph, Boletim Da Sociedade Paranaense de Matem´atica, 42 (2024), 1-12.
[5] F. Buckley and F. Harary, Distance in Graphs, Addition - Wesley Publishing Company, Redwood City, California, 1990.
[6] G. Chartrand and P. Zhang, The Steiner number of a graph, Discrete Mathematics, 242 (2002), 41-54.
[7] Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato and Michele Torielli, Total domination of middle graphs, Electronic Journal of graph theory and applications, 10 (1) (2022), 275-288.
[8] S. Gomathi Radha, K. Ramalakshmi and A. Mahalakshmi, Strong hop Steiner Domination in graphs, International Journal of Creative Research Thoughts (IJCRT), 12(4) (2024), d590-d595.
[9] Ignacio M Pelayo, Comment on ”The Steiner number of a graph”, Discrete Mathematics, 280(1-3) (2004), 259-263.
[10] C. Jayasekaran and S.V. Ashwin Prakash, Detour Global Domination for Degree Splitting graphs of some graphs, Ratio Mathematica - Journal of Mathematics, Statistics, and Applications, 47 (2023), 290-299.
[11] J. John and S. Ancymary, The edge-to-vertex Steiner domination number of a graph, TWMS Journal of Applied And Engineering Mathematics, 12(4) (2022), 1311-1321.
[12] J. John and M.S. Malchijah Raj, On the complement connected Steiner number of a graph, Acta Mathematica Universitatis Comenianae, 90(4) (2021), 377-386.
[13] C. Natarajan and S.K. Ayyaswamy, Hop domination sets in graphs-II, Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica, (ASUOC), 23(2) (2015), 187-199.
[14] S. Natarajan, A. Vijaya and B. Aswini, Hop domination number of Lollipop graph, Barbell graph and Book graph, Juni Khyat, 12(09) (2022), 205-214.
[15] Raja Ponraj and Shobna Somasundaram, On the degree splitting graph of a graph, National Academy Science Letters, 27 (7-8) (2004), 275-278.
[16] S.K. Vaidya and S.H. Karkar, Steiner domination number of some graphs, International Journal of Mathematics and Scientific Computing, 5(2) (2015), 1-3.
Journal of Hyperstructures

Articles in Press, Accepted Manuscript
Available Online from 20 June 2026

Files

Share

How to cite

Statistics