The maximum corank of graphs with a 2-separation

DOI10.1016/J.LAA.2007.10.005MaRDI QIDQ2477537zbMATH OpenOpenAlexFDO

Authors Hein van der Holst

Publication date 14 March 2008

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

Full work available at URL https://doi.org/10.1016/j.laa.2007.10.005

zbMATH Keywords

connectivitygraphminimum rankseparationsymmetric matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• Maximum order of graphs with a given corank
• On the maximum positive semi-definite nullity and the cycle matroid of graphs
• The inertia sets of graphs with a 2-separation
• Decompositions of minimum rank matrices
• Two-connected signed graphs with maximum nullity at most two

Cites work

• A characterization of tridiagonal matrices
• Computation of minimal rank and path cover number for certain graphs
• Graphs whose minimal rank is two
• Minimum rank of a graph over an arbitrary field
• Minimum-rank matrices with prescribed graph
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree

Cited in

(11)

• Algorithmic techniques for finding resistance distances on structured graphs
• f-class two graphs whose f-cores have maximum degree two
• The inertia set of a signed graph
• On the rank spread of graphs
• Decompositions of minimum rank matrices
• Minimum rank of outerplanar graphs
• Computing inertia sets using atoms
• The classification of graphs on eight vertices with coinciding zero forcing number and maximum nullity
• The inertia sets of graphs with a 2-separation
• Maximum nullity of outerplanar graphs and the path cover number
• On minimum rank and zero forcing sets of a graph

This page was built for publication: The maximum corank of graphs with a 2-separation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477537)