Degree distance index of class of graphs

Document Type : Original paper

Authors

Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal-576104, India

Abstract

The topological indices are the numerical parameters of a graph that characterize the topology of a graph and are usually graph invariant. The topological indices are classified based on the properties of graphs. The degree distance index is the topological index which is calculated by counting the degrees and distance between the vertices. In this paper, the degree distance index of the connected thorn graph, the graph obtained by joining an edge between two connected graphs, and one vertex union of two connected graphs are calculated.

Keywords

Main Subjects

References

[1] G. Al Hagri, M. El Marraki, and M. Essalih, The degree distance of certain particular graphs, Appl. Math. Sci. 6 (2012), no. 18, 857–867.
[2] M. Azari, On the Gutman index of Thorn graphs, Kragujevac J. Sci. 40 (2018), 33–48. https://doi.org/10.5937/KgJSci1840033A
[3] G. Chartrand and P. Zhang, A First Course in Graph Theory, Courier Corporation, 2013.
[4] A.A. Dobrynin and A.A. Kochetova, Degree distance of a graph: A degree analog of the wiener index, J. Chem. Inf. Comput. 34 (1994), no. 5, 1082–1086.  https://doi.org/10.1021/ci00021a008
[5] I. Gutman, Distance of thorny graph, Publ. Inst. Math. 63(77) (1998), no. 83, 31–36.
[6] P. Paulraja and V.S. Agnes, Degree distance of product graphs, Discrete Math. Algorithms Appl . 6 (2014), no. 1, Article ID: 1450003.  https://doi.org/10.1142/S1793830914500037
[7] S. Sedghi and N. Shobe, Degree distance and gutman index of two graph products, J. Algebra Comb. Discrete Struct. Appl. 7 (2020), no. 2.
[8] D. Vukičević, S. Nikolić, and N. Trinajstić, On the schultz index of thorn graphs, Internet Electron. J. Mol. Des. 4 (2005), no. 7, 501–514.
[9] D.B. West, Introduction to Graph Theory, Prentice hall Upper Saddle River, 2001.
[10] H. Wiener, Structural determination of paraffin boiling points, J. Am. Chem. Soc. 69 (1947), no. 1, 17–20. https://doi.org/10.1021/ja01193a005
Communications in Combinatorics and Optimization
Volume 10, Issue 2
June 2025
Pages 453-462

Files

Share

How to cite

Statistics