Regularity and the generalized adjacency spectra of graphs (Q2496664): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.laa.2006.01.026 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3109323863 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4327350 / 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: Cospectral graphs and the generalized adjacency matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Problems in algebraic combinatorics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumeration of cospectral graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on cospectral graphs / rank | |||
Normal rank |
Latest revision as of 18:13, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Regularity and the generalized adjacency spectra of graphs |
scientific article |
Statements
Regularity and the generalized adjacency spectra of graphs (English)
0 references
20 July 2006
0 references
The paper solves the following problem of van Dam and Haemers: Given a rational number \(x\in(0,1)\), construct a pair of graphs, one regular and the other nonregular with adjacency matrices \(A_1\) and \(A_2\), having the property that \(A_1-xJ\) and \(A_2-xJ\) have the same spectrum (where \(J\) is the all-ones matrix). The authors also give a construction of the smallest examples for some suitably chosen values of \(x\).
0 references
spectrum
0 references
eigenvalues
0 references