No label defined (Q4724664)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3997841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3997841 |
Statements
1986
0 references
adjacency matrix
0 references
spectrum
0 references
pseudocyclic graphs
0 references
0.7669815421104431
0 references
0.7606461644172668
0 references
0.7582300901412964
0 references
0.757685124874115
0 references
0.75599205493927
0 references
[For the entire collection see Zbl 0608.00005.] The spectrum of a graph is the spectrum of its 0-1 adjacency matrix. The spectrum of a graph is denoted by \(\{\lambda_ 1^{m_ 1},...,\lambda_ t^{m_ t}\}\); where \(\lambda_ i\) is an eigenvalue with multiplicity \(m_ i\). The paper considers pseudocyclic graphs, i.e. those regular graphs which satisfy \(m_ 2=m_ 3=...=m_ t\).
0 references