On the largest eigenvalue of the distance matrix of a connected graph
By Bo Zhou, Nenad Trinajstic. 2007
67 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/fb8883145ee6869d237c339345b50e55dae433f8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Aleksandar Ilić
- Bo Zhou
- Dragan Stevanovic
- Ivan Gutman
- Nenad Trinajstic
- Zoran Stanic
- Vladimir Nikiforov
- Kexiang Xu
In Geometry and Topology
- Aleksandar Ilić
- Bo Zhou
- Dragan Stevanovic
- Ivan Gutman
- Vladimir Nikiforov
- Nenad Trinajstic
- Zoran Stanic
- Slobodan K. Simic
Citations in the corpus
- On Distance Spectral Radius and Distance Energy of Graphs (2011, methodology): “In [6], the authors provided lower and upper bounds for ρ(G) when G is a connected graph in terms of the number of vertices, the sum of the squares of the distances between all unordered pairs of vertices and the sum of the distances between a given vertex and all other vertices, and the Nordhaus–Ga”
- Distance spectral radius of trees with fixed maximum degree (2010, background): “…spectral radius ̺(G) = ̺G of G is the largest eigenvalue of the distance matrix D of a graph G. Distance energy DE(G) is a newly introduced molecular graph-based analog of the total π-electron energy, and it is defined as the sum of the absolute eigenvalues of the molecular distance matrix.”