An application of Hoffman graphs for spectral characterizations of graphs (Q510321): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
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
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1608.08800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Godsil-McKay switching and isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral characterization of the Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular graphs with four eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-signed graphs with smallest eigenvalue greater than \(-2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlacing eigenvalues and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Polynomial of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fat Hoffman graphs with smallest eigenvalue at least -3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a theorem of Hoffman / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Uniqueness of the $\mathrm{L}_2$ Association Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limit points of the smallest eigenvalues of regular graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:25, 13 July 2024

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
    0 references
    0 references
    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
    0 references
    Hoffman graph
    0 references
    graph eigenvalue
    0 references
    interlacing
    0 references
    walk-regular graph
    0 references
    spectral characterization
    0 references
    0 references