An application of Hoffman graphs for spectral characterizations of graphs (Q510321): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: In this paper, we present the first application of Hoffman graphs for spectral characterizations of graphs. In particular, we show that the 2-clique extension of the \((t+1)\times (t+1)\)-grid is determined by its spectrum when \(t\) is large enough. This result will help to show that the Grassmann graph \(J_2(2D,D)\) is determined by its intersection numbers as a distance regular graph, if \(D\) is large enough. The main tool we are using is Hoffman graphs. | |||
Property / review text: Summary: In this paper, we present the first application of Hoffman graphs for spectral characterizations of graphs. In particular, we show that the 2-clique extension of the \((t+1)\times (t+1)\)-grid is determined by its spectrum when \(t\) is large enough. This result will help to show that the Grassmann graph \(J_2(2D,D)\) is determined by its intersection numbers as a distance regular graph, if \(D\) is large enough. The main tool we are using is Hoffman graphs. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6686265 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Hoffman graph | |||
Property / zbMATH Keywords: Hoffman graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph eigenvalue | |||
Property / zbMATH Keywords: graph eigenvalue / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
interlacing | |||
Property / zbMATH Keywords: interlacing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
walk-regular graph | |||
Property / zbMATH Keywords: walk-regular graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
spectral characterization | |||
Property / zbMATH Keywords: spectral characterization / rank | |||
Normal rank |
Revision as of 03:39, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An application of Hoffman graphs for spectral characterizations of graphs |
scientific article |
Statements
An application of Hoffman graphs for spectral characterizations of graphs (English)
0 references
17 February 2017
0 references
Summary: In this paper, we present the first application of Hoffman graphs for spectral characterizations of graphs. In particular, we show that the 2-clique extension of the \((t+1)\times (t+1)\)-grid is determined by its spectrum when \(t\) is large enough. This result will help to show that the Grassmann graph \(J_2(2D,D)\) is determined by its intersection numbers as a distance regular graph, if \(D\) is large enough. The main tool we are using is Hoffman graphs.
0 references
Hoffman graph
0 references
graph eigenvalue
0 references
interlacing
0 references
walk-regular graph
0 references
spectral characterization
0 references