On the eigenvalues of distance powers of circuits

DOI10.1016/J.LAA.2010.01.012zbMATH Open1214.05084arXiv1112.3202OpenAlexW2093253182MaRDI QIDQ968986FDOQ968986

Authors: T. Sander, J. W. Sander 

Publication date: 11 May 2010

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

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.

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

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

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)

Cites Work

• Interlacing eigenvalues and graphs
• Eigenspaces of graphs
• Title not available (Why is that?)
• Circulants and their connectivities
• Title not available (Why is that?)
• Trigonometric diophantine equations (On vanishing sums of roots of unity)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integral circulant graphs
• Rees algebras of edge ideals
• PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS
• On the null-spaces of acyclic and unicyclic singular graphs
• Title not available (Why is that?)
• More about singular line graphs of trees
• On certain eigenspaces of cographs
• \(\{-1,0,1\}\)-basis for the null space of a forest
• Sudoku graphs are integral
• Title not available (Why is that?)
• On simply structured bases of tree kernels
• Title not available (Why is that?)
• On the kernels of the incidence matrices of graphs
• The kernels of the incidence matrices of graphs revisited
• On simply structured kernel bases of unicyclic graphs

Cited In (9)

• Distance eigenvalues and forwarding indices of circulants
• On circuit diameter bounds via circuit imbalances
• Title not available (Why is that?)
• On the least distance eigenvalues of the second power of a graph
• Formulas versus Circuits for Small Distance Connectivity
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
• Maximal and extremal singular graphs
• On the two largest distance eigenvalues of graph powers
• Singular distance powers of circuits

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)