On the two largest distance eigenvalues of graph powers

DOI10.1016/j.ipl.2016.11.008zbMath1400.05152OpenAlexW2559764171MaRDI QIDQ503610

Bo Zhou, Rundan Xing

Publication date: 13 January 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.11.008

zbMATH Keywords

treecombinatorial problemsunicyclic graphdistance eigenvalues\(k\)-th power of a graph

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

On the least distance eigenvalues of the second power of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Performance guarantees for the TSP with a parameterized triangle inequality
• On the eigenvalues of distance powers of circuits
• On colorings of graph powers
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• The Gewirtz graph: An exercise in the theory of graph spectra
• On distance matrices and Laplacians
• Laplacian eigenvalues of the second power of a graph
• Distance spectra of graphs: a survey
• On the distance spectral radius of trees
• Locality in Distributed Graph Algorithms
• Tree Powers
• The Chromatic Number of Graph Powers
• Recognizing Powers of Proper Interval, Split, and Chordal Graphs
• Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
• Structure and linear-time recognition of 4-leaf powers
• On the Addressing Problem for Loop Switching
• On the second largest distance eigenvalue