The rank of a graph after vertex addition

From MaRDI portal
Publication:1369345

DOI10.1016/S0024-3795(96)00513-7zbMath0884.05061WikidataQ126351574 ScholiaQ126351574MaRDI QIDQ1369345

Valerie A. Miller, Gayla S. Domke, Kevin K. Blount, George J. Davis, Jean H. Bevis

Publication date: 20 October 1997

Published in: Linear Algebra and its Applications (Search for Journal in Brave)




Related Items (25)

Behavior of the binary rank of a graph when vertices and edges are addedThe nullity ofk-cyclic graphs of ∞-typeBounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rankRelation between the inertia indices of a complex unit gain graph and those of its underlying graphCharacterization of graphs whose signature equals the number of odd cyclesThe rank of a signed graphBounds for the rank of a complex unit gain graph in terms of the independence numberSome relations between rank of a graph and its complementThe rank of a complex unit gain graph in terms of the matching numberThe rank of a signed graph in terms of the rank of its underlying graphBounds for the matching number and cyclomatic number of a signed graph in terms of rankThe rank of a complex unit gain graph in terms of the rank of its underlying graphUnnamed ItemUnnamed ItemUnnamed ItemOn the spectrum of the normalized graph LaplacianMaximal graphs with respect to rankRelation between the \(H\)-rank of a mixed graph and the rank of its underlying graphNo signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\)Relationship between the rank and the matching number of a graphOn the relationship between the skew-rank of an oriented graph and the rank of its underlying graphRelation between the skew-rank of an oriented graph and the rank of its underlying graphRelation between the rank of a signed graph and the rank of its underlying graphOn the nullity number of graphsSkew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph



Cites Work




This page was built for publication: The rank of a graph after vertex addition