On the eigenvalues of distance powers of circuits

DOI10.1016/J.LAA.2010.01.012MaRDI QIDQ968986zbMATH OpenOpenAlexFDO

Authors T. Sander, J. W. Sander

Publication date 11 May 2010

Published in Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

circuit graphintegral eigenvaluesdistance powereigenspace basis

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Abstract: Taking the d-th distance power of a graph, one adds edges between all pairs of vertices of that graph whose distance is at most d. It is shown that only the numbers -3, -2, -1, 0, 1, 2d can be integer eigenvalues of a circuit distance power. Moreover, their respective multiplicities are determined and explicit constructions for corresponding eigenspace bases containing only vectors with entries -1, 0, 1 are given.

Recommendations

• Singular distance powers of circuits
• scientific article; zbMATH DE number 3977041
• On the least distance eigenvalues of the second power of a graph
• On the two largest distance eigenvalues of graph powers
• Distance eigenvalues and forwarding indices of circulants

Cites work

• scientific article; zbMATH DE number 3650737 (Why is no real title available?)
• scientific article; zbMATH DE number 3708485 (Why is no real title available?)
• scientific article; zbMATH DE number 977801 (Why is no real title available?)
• scientific article; zbMATH DE number 1491632 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 2188464 (Why is no real title available?)
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• scientific article; zbMATH DE number 3065066 (Why is no real title available?)
• Circulants and their connectivities
• Eigenspaces of graphs
• Integral circulant graphs
• Interlacing eigenvalues and graphs
• More about singular line graphs of trees
• On certain eigenspaces of cographs
• On simply structured bases of tree kernels
• On simply structured kernel bases of unicyclic graphs
• On the kernels of the incidence matrices of graphs
• On the null-spaces of acyclic and unicyclic singular graphs
• PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS
• Rees algebras of edge ideals
• Sudoku graphs are integral
• The kernels of the incidence matrices of graphs revisited
• Trigonometric diophantine equations (On vanishing sums of roots of unity)
• \(\{-1,0,1\}\)-basis for the null space of a forest

Cited in

(10)

• The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds
• Distance eigenvalues and forwarding indices of circulants
• Formulas versus Circuits for Small Distance Connectivity
• Maximal and extremal singular graphs
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
• Singular distance powers of circuits
• On circuit diameter bounds via circuit imbalances
• On the least distance eigenvalues of the second power of a graph
• On the two largest distance eigenvalues of graph powers
• scientific article; zbMATH DE number 3977041 (Why is no real title available?)

This page was built for publication: On the eigenvalues of distance powers of circuits

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