Graphs with three distinct distance eigenvalues

DOI10.1016/J.AMC.2023.127848MaRDI QIDQ2698139zbMATH OpenOpenAlexFDO

Authors Yuke Zhang, Huiqiu Lin

Publication date 21 April 2023

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2112.10375

zbMATH Keywords

distance eigenvaluesdistinct eigenvalues

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• The graphs with exactly two distance eigenvalues different from -1 and -3
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• On graphs with at least three distance eigenvalues less than \(-1\)
• On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
• Distance-regular graphs with small number of distinct distance eigenvalues

Cites work

• A survey on distance spectra of graphs
• Addressing the Petersen graph
• Distance eigenvalues of a cograph and their multiplicities
• Distance spectra of graphs: a survey
• Factoring distance matrix polynomials
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3839994 (Why is no real title available?)
• Hypercubes are determined by their distance spectra
• On distance energy of graphs
• On Moore Graphs with Diameters 2 and 3
• On the Addressing Problem for Loop Switching
• On the distance spectra of threshold graphs
• On the distribution of Laplacian eigenvalues of trees
• On the least distance eigenvalue and its applications on the distance spread
• Sharp bounds on the distance spectral radius and the distance energy of graphs
• The distance spectrum of a tree
• The distance spectrum of the pathP_nand The First Distance Eigenvector of Connected Graphs
• The graphs with exactly two distance eigenvalues different from -1 and -3
• The multiplicity of \(-2\) as an eigenvalue of the distance matrix of graphs
• Thekth Laplacian eigenvalue of a tree

Cited in

(10)

• Graphs with three distinct eigenvalues and largest eigenvalue less than 8
• A problem concerning graphs with just three distinct eigenvalues
• Graphs with three distinct -eigenvalues
• Graphs whose distance matrix has at most three negative eigenvalues
• On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
• Three distance characteristic polynomials of some graphs
• The graphs with exactly two distance eigenvalues different from -1 and -3
• Distance-regular graphs with a few q-distance eigenvalues
• Graphs with three distinct distance eigenvalues
• Inertia and energy of the distance matrix

This page was built for publication: Graphs with three distinct distance eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698139)