ON SPECTRA OF TERMINAL D-DISTANCE MATRIX OF SOME CLASS OF GRAPHS | Asian Journal of Mathematics

In this study, we'll look at basic graphs, where all vertices of degree one are referred to as pendent vertices or terminal vertices. G D-distance is the sum of degrees of all the vertices of path, including degrees of for two terminal vertices of a graph G D-distance is the sum of degrees of all the vertices of path, including degrees of The purpose of this work is to define the terminal D-distance matrix and compute the terminal D-distance energy of a few graph classes. There are also bounds on Terminal-D-distance energy.

Please see the link :- https://www.ikprress.org/index.php/AJOMCOR/article/view/6422