The rank of a graph after vertex addition (Q1369345)
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 1076369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The rank of a graph after vertex addition |
scientific article; zbMATH DE number 1076369 |
Statements
The rank of a graph after vertex addition (English)
0 references
20 October 1997
0 references
The rank of the adjacency matrix of a graph, and the way it changes when a new vertex is added to the graph, are investigated for several classes of graphs. The question is related to determining the multiplicity of a zero eigenvalue of the adjacency matrix, which has applications in physics, chemistry and other fields.
0 references
graph spectra
0 references
rank
0 references
adjacency matrix
0 references
eigenvalue
0 references
0.8156543970108032
0 references
0.7932142019271851
0 references
