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

DOI10.1007/S00373-021-02445-ZzbMATH Open1484.05124arXiv2102.10155OpenAlexW4220945675MaRDI QIDQ2115142FDOQ2115142

Authors: Sebastian Cioaba, Himanshu Gupta 

Publication date: 15 March 2022

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

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.

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

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

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)

Cites Work

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

Cited In (1)

• Optimal and extremal graphical designs on regular graphs associated with classical parameters

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)