On the construction of graphs of nullity one (Q1381857)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the construction of graphs of nullity one |
scientific article; zbMATH DE number 1135965
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the construction of graphs of nullity one |
scientific article; zbMATH DE number 1135965 |
Statements
On the construction of graphs of nullity one (English)
0 references
1 April 1998
0 references
The author classifies the sets of \(k\) \((2\leq k\leq 5)\) linearly dependent rows of the adjacency matrix of a graph. Induced subgraphs related to these sets can be of some help in determining the multiplicity of the eigenvalue \(0\). Some constructions of graphs having eigenvalue \(0\) in the spectrum are given as well.
0 references
adjacency matrix
0 references
eigenvalue
0 references
