The eigenvalues of q-Kneser graphs

2011/05/13 by Benjian Lv, Lv, Benjian, Kaishun Wang +1 · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1105.2673

openalex publication_date 2011/05/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this note, we prove some combinatorial identities and obtain a simple form of the eigenvalues of q-Kneser graphs.

Cited by

• Advances in the Shannon Capacity of Graphs
• Character tables of association schemes based on attenuated spaces

Related

• Choice number of Kneser graphs
• The Chromatic Number of the q-Kneser Graph for q ≥ 5
• Characterization of tricyclic graphs with exactly two Q-main eigenvalues
• On the b-chromatic number of Kneser Graphs
• Ramsey Numbers in Kneser Graphs