On Spectra of D-Eccentricity Matrix of Some Graphs


Abstract views: 79 / PDF downloads: 60

Authors

  • Prabhakar 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
  • Jotiba P. Kitturkar Department of Mathematics, Maratha Mandal Engineering College, Belagavi, Karnataka, India

Keywords:

Distance, D-distance, Eccentricity matrix, Spectrum

Abstract

For any two vertices $u$ and $v$ of a graph $G$, $d(u, v)$ is the length of the shortest path between the vertices $u$ and $v$. D. Reddy Babu and P.L.N. Varma introduced the concept of D-distance. D-distance considers the degree of all vertices present in a path while defining its length. In this paper, D-eccentricity spectra of D-eccentricity matrix of some class of graphs are computed.

Downloads

Published

15-12-2020

How to Cite

Prabhakar R. Hampiholi, Anjana S. Joshi, & Jotiba P. Kitturkar. (2020). On Spectra of D-Eccentricity Matrix of Some Graphs. International Journal of Mathematics And Its Applications, 8(4), 59–68. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/119

Issue

Vol. 8 No. 4 (2020)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.