Star complements and exceptional graphs (Q876316): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Dragos Cvetković / rank | |||
Property / author | |||
Property / author: Peter Rowlinson / rank | |||
Property / author | |||
Property / author: Slobodan K. Simic / rank | |||
Property / reviewed by | |||
Property / reviewed by: Reinhardt Euler / rank | |||
Property / author | |||
Property / author: Dragos Cvetković / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Peter Rowlinson / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Slobodan K. Simic / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Reinhardt Euler / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.laa.2007.01.008 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2143618306 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5421112 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON THE MULTIPLICITIES OF GRAPH EIGENVALUES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exceptional graphs with smallest eigenvalue -2 and related problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5421116 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4327350 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cospectral graphs with least eigenvalue at least -2 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximal exceptional graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2785496 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with least eigenvalue \(-2\): The star complement technique / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4828550 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On spectral characterization and embeddings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4286076 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some results on graph spectra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4457010 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Co-cliques and star complements in extremal strongly regular graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:35, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Star complements and exceptional graphs |
scientific article |
Statements
Star complements and exceptional graphs (English)
0 references
18 April 2007
0 references
Let \(G\) be a finite graph of order \(n\) with an eigenvalue \(\mu\) of multiplicity \(k\). (Thus the \(\mu\)-eigenspace of a \((0,1)\)-adjacency matrix of \(G\) has dimension \(k\).) A star complement for \(\mu\) in \(G\) is an induced subgraph \(G-X\) of \(G\) such that \(| X| =k\) and \(G-X\) does not have \(\mu\) as an eigenvalue. An exceptional graph is a connected graph, other than a generalized line graph, whose eigenvalues lie in \([-2,\infty)\). The authors investigate properties of star sets and star complements related to graphs with least eigenvalue \(-2\), and explain some phenomena observed from earlier computer results. Explicitly, they give a simple computer-free proof that each exceptional graph with least eigenvalue greater than \(-2\) is an induced subgraph of an exceptional graph with least eigenvalue equal to \(-2\). They also show how extendability graphs can be used to investigate the regular exceptional graphs. Finally, they establish a property of eigenvectors of exceptional graphs with \(-2\) as a simple eigenvalue.
0 references
graph
0 references
eigenvalue
0 references
star complement
0 references