On the distance spectra of graphs
Publication:254892
DOI10.1016/j.laa.2016.02.018zbMath1331.05131arXiv1509.01196OpenAlexW1753959406MaRDI QIDQ254892
Kristin Heysse, Aida Abiad, Jessica De Silva, Jay Cummings, Michael Tait, Zhanar Berikkyzy, Franklin H. J. Kenter, Jephian C.-H. Lin, Wei Gao, Leslie Hogben, Ghodratollah Aalipour
Publication date: 8 March 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.01196
grapheigenvaluestrongly regular graphdeterminantinertiadistance regular graphdistance matrixbarbell graphdistance spectrumDoob graphdouble odd graphKneser graphlollipop graphoptimistic graph
Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Hermitian, skew-Hermitian, and related matrices (15B57) Distance in graphs (05C12)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distance spectra of graphs
- A short note on a short remark of Graham and Lovász
- Sur les inégalités valides dans \(L^ 1\)
- Distance-regular graphs the distance matrix of which has only one positive eigenvalue
- Distance spectra of graphs: a survey
- On the distance spectrum of distance regular graphs
- Zero forcing sets and the minimum rank of graphs
- On the diameter of Kneser graphs
- Symplectic graphs and their automorphisms
- Distance spectrum of graph compositions
- The distance spectrum of a tree
- HYPERMETRIC GRAPHS
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- On the Addressing Problem for Loop Switching