ON SPECTRA OF TERMINAL D-DISTANCE MATRIX OF SOME CLASS OF GRAPHS

PDF

Published: 2021-06-01

Page: 8-15


P. R. HAMPIHOLI

Department of Mathematics, KLS Gogte Institute of Technology, Belagavi, Karnataka, India.

ANJANA S. JOSHI *

Department of Mathematics, KLS Gogte Institute of Technology, Belagavi, Karnataka, India.

P. V. ADHYAPAK

Department of Mathematics, KLS Gogte Institute of Technology, Belagavi, Karnataka, India.

S. R. KABBUR

Department of Mathematics, KLS Gogte Institute of Technology, Belagavi, Karnataka, India.

*Author to whom correspondence should be addressed.


Abstract

In this paper we consider simple graphs, all the vertices with degree one are known as pendent vertices or terminal vertices of a graph. For two terminals vertices  of a graph G  D-distance is addition of the distance between  and the sum of degrees of all the vertices of path , including degrees of . This paper consists of definition of terminal D-distance matrix and computation of terminal D-distance energy of few class of graphs. Bounds on Terminal-D-distance energy are also established.

Keywords: D-distance, spectra, terminal vertex, terminal matrix, energy, bounds


How to Cite

HAMPIHOLI, P. R., ANJANA S. JOSHI, P. V. ADHYAPAK, and S. R. KABBUR. 2021. “ON SPECTRA OF TERMINAL D-DISTANCE MATRIX OF SOME CLASS OF GRAPHS”. Asian Journal of Mathematics and Computer Research 28 (2):8-15. https://ikprress.org/index.php/AJOMCOR/article/view/6422.

Downloads

Download data is not yet available.