On the Terminal Distance Matrix of Graphs
Let G be a simple connected graph.The terminal distance matrix of G is the distance matrix between all pendant vertices of G.In this paper, we study the terminal distance matrix and compute the characteristic polynomial of this matrix for some rooted trees.Also we obtain lower bounds for the spectral radius of the terminal distance matrix of graphs and characterize those graphs for which the bounds are best possible.
Authors
- Abbas Heydari (ORCID: https://orcid.org/0000-0002-0354-4383)
Institutions
- Arak University of Technology (IR)
Publication Details
- Journal
- Iranian Journal of Mathematical Sciences and Informatics
- Published
- 2025-04-01
- DOI
- https://doi.org/10.61186/ijmsi.20.1.231
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00