On regular graphs with four distinct eigenvalues

DOI10.1016/j.laa.2016.09.043zbMath1348.05125arXiv1605.05421OpenAlexW2405779299MaRDI QIDQ332649

Xueyi Huang, Qiong Xiang Huang

Publication date: 8 November 2016

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

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

zbMATH Keywords

eigenvaluesregular graphs

Mathematics Subject Classification ID

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

Related Items

A spectral characterization of the \(s\)-clique extension of the square grid graphs, Seidel spectrum of threshold graphs, Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\), On the multiplicity of the least signless Laplacian eigenvalue of a graph, On graphs with three distinct signless Laplacian eigenvalues, On the multiplicity of Laplacian eigenvalues for unicyclic graphs, On 2-equitable graphs, Graphs with two main and two plain eigenvalues, Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues, Graphs with at most Four Seidel Eigenvalues, Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues, Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\), On split graphs with three or four distinct (normalized) Laplacian eigenvalues, Two characterizations of the grid graphs, Characterization of graphs with an eigenvalue of large multiplicity, Graphs with few distinct eigenvalues and extremal energy, On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity, Monotonic normalized heat diffusion for regular bipartite graphs with four eigenvalues, The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5

Cites Work

• Unnamed Item
• Biregular graphs with three eigenvalues
• On graphs with just three distinct eigenvalues
• Combinatorial designs with two singular values. I: Uniform multiplicative designs
• On graphs with exactly one eigenvalue less than -1
• Feasibility conditions for the existence of walk-regular graphs
• Multiplicative cones - a family of three eigenvalue graphs
• Nonregular graphs with three eigenvalues
• The Gewirtz graph: An exercise in the theory of graph spectra
• Which graphs are determined by their spectrum?
• On graphs with three eigenvalues
• Small regular graphs with four eigenvalues
• Combinatorial designs with two singular values. II: Partial geometric designs
• A nonregular analogue of conference graphs
• Regular graphs with four eigenvalues
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The non-bipartite graphs with all but two eigenvalues in [–1, 1]
• Graphs with many valencies and few eigenvalues
• GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES