On the eigenvalues of Grassmann graphs, bilinear forms graphs and Hermitian forms graphs

DOI10.1007/S00373-021-02445-ZMaRDI QIDQ2115142zbMATHOpenAlexFDO

Authors Sebastian Cioaba, Himanshu Gupta

Publication date 15 March 2022

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

smallest eigenvaluemax-cutdistance-regular graphsGaussian coefficientsGrassmann graphsbilinear forms graphsHermitian forms graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Semidefinite programming (90C22) Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Linear codes (general theory) (94B05)

Abstract: Recently, Brouwer, Cioabu{a}, Ihringer and McGinnis obtained some new results involving the eigenvalues of various graphs coming from association schemes and posed some conjectures related to the eigenvalues of Grassmann graphs, bilinear forms graphs and Hermitian forms graphs. In this paper, we prove some of their conjectures.

Recommendations

• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
• Minimum supports of eigenfunctions in bilinear forms graphs
• A unified approach to a characterization of Grassmann graphs and bilinear forms graphs
• On a characterization of bilinear forms graphs
• Two remarks on Huang's characterization of the bilinear forms graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• A partially ordered set and q-Krawtchouk polynomials
• Association schemes and t-designs in regular semilattices
• Bilinear forms over a finite field, with applications to coding theory
• Bipartite Subgraphs and the Smallest Eigenvalue
• Constructing worst case instances for semidefinite programming based approximation algorithms
• Erdős-Ko-Rado theorems. Algebraic approaches
• Hermitian rank distance codes
• How Good is the Goemans--Williamson MAX CUT Algorithm?
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
• Spectra of graphs
• Spherically Punctured Biorthogonal Codes
• The eigenspaces of the Bose-Mesner algebras of the association schemes corresponding to projective spaces and polar spaces
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters

Cited in

(3)

• Optimal and extremal graphical designs on regular graphs associated with classical parameters
• The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters
• Minimum supports of eigenfunctions in bilinear forms graphs

This page was built for publication: On the eigenvalues of Grassmann graphs, bilinear forms graphs and Hermitian forms graphs

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