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.
Recommendations
Cites work
- scientific article; zbMATH DE number 12941 (Why is no real title available?)
- scientific article; zbMATH DE number 540115 (Why is no real title available?)
- scientific article; zbMATH DE number 798644 (Why is no real title available?)
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- Integer LU-factorizations
Cited in
(32)- The rank of a signed graph in terms of the rank of its underlying graph
- Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph
- Relationship between the rank and the matching number of a graph
- Behavior of the binary rank of a graph when vertices and edges are added
- The rank of a signed graph
- The rank of a complex unit gain graph in terms of the matching number
- Maximal graphs with respect to rank
- No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- The rank of a complex unit gain graph in terms of the rank of its underlying graph
- Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
- Characterization of graphs whose signature equals the number of odd cycles
- The nullity of \(k\)-cyclic graphs of \(\infty\)-type
- scientific article; zbMATH DE number 1472094 (Why is no real title available?)
- Multiplicities: adding a vertex to a graph
- On the nullity number of graphs
- Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
- Relation between the inertia indices of a complex unit gain graph and those of its underlying graph
- Bounds for the rank of a complex unit gain graph in terms of the independence number
- Relation between the rank of a signed graph and the rank of its underlying graph
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- scientific article; zbMATH DE number 7692350 (Why is no real title available?)
- scientific article; zbMATH DE number 7705679 (Why is no real title available?)
- The nullities of signed cycle-spliced graphs
- The gap between the rank of a complex unit gain graph and its underlying graph
- Characterization of graphs with rank 2v(G) - 2(G) - 2c(G) + 1
- The rank of a complex unit gain graph in terms of the rank and the independence number of its underlying graph
- Existence of a non-zero (0, 1)-vector in the row space of adjacency matrices of simple graphs
- Improved bounds on the H-rank of a mixed graph in terms of the matching number and fractional matching number
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Some relations between rank of a graph and its complement
- On the spectrum of the normalized graph Laplacian
This page was built for publication: The rank of a graph after vertex addition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369345)
