The closeness eigenvalues of graphs
From MaRDI portal
Publication:6083969
DOI10.1007/s10801-023-01270-2zbMath1525.05125OpenAlexW4386954463MaRDI QIDQ6083969
Publication date: 31 October 2023
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-023-01270-2
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A shorter proof of the distance energy of complete multipartite graphs
- Spectra of graphs
- The generalized distance matrix
- Distance spectra of graphs: a survey
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations
- A \(q\)-analogue of the distance matrix of a tree
- On a property of the class of n-colorable graphs
- Spectral properties of the exponential distance matrix
- RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
- The Comparability Graph of a Tree
- Graphs characterized by the second eigenvalue
- On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
- On the spectral closeness and residual spectral closeness of graphs
- Networks with Extremal Closeness
- A Note on "The Comparability Graph of a Tree"
- On the second largest distance eigenvalue
This page was built for publication: The closeness eigenvalues of graphs