On the Terminal Distance Matrix of Graphs
Copyright policy )On the Terminal Distance Matrix of Graphs
Summary: 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.
- Arak University of Technology Iran (Islamic Republic of)
Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), terminal distance spectral radius, terminal distance matrix, terminal Wiener index
Distance in graphs, Graphs and linear algebra (matrices, eigenvalues, etc.), terminal distance spectral radius, terminal distance matrix, terminal Wiener index
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!