Graphs whose minimal rank is two
From MaRDI portal
Publication:4656572
DOI10.13001/1081-3810.1137zbMath1070.05059OpenAlexW1584938588MaRDI QIDQ4656572
Raphael Loewy, Hein van der Holst, Wayne W. Barrett
Publication date: 11 March 2005
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/125039
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Structural characterization of families of graphs (05C75) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (45)
On the minimum semidefinite rank of signed graphs ⋮ Linearly independent vertices and minimum semidefinite rank ⋮ The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample ⋮ Computation of minimal rank and path cover number for certain graphs ⋮ Minimum rank problems ⋮ The inertia set of a signed graph ⋮ Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph ⋮ The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph ⋮ Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns ⋮ Techniques for determining equality of the maximum nullity and the zero forcing number of a graph ⋮ On the minimum rank of the join of graphs and decomposable graphs ⋮ Graphs with real algebraic co-rank at most two ⋮ Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\) ⋮ Maximum nullity and zero forcing of circulant graphs ⋮ Bounds for minimum semidefinite rank from superpositions and cutsets ⋮ On the graph complement conjecture for minimum rank ⋮ Computing inertia sets using atoms ⋮ The minimum semidefinite rank of the complement of partial \(k\)-trees ⋮ The inertia set of the join of graphs ⋮ Sparks of symmetric matrices and their graphs ⋮ Positive semidefinite zero forcing ⋮ The inverse inertia problem for the complements of partial \(k\)-trees ⋮ Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs ⋮ Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph ⋮ Orthogonal representations, minimum rank, and graph complements ⋮ Graphs that allow all the eigenvalue multiplicities to be even ⋮ Three-connected graphs whose maximum nullity is at most three ⋮ Graphs with few trivial characteristic ideals ⋮ The minimum rank of matrices and the equivalence class graph ⋮ On acyclic and unicyclic graphs whose minimum rank equals the diameter ⋮ An upper bound for the minimum rank of a graph ⋮ The maximum corank of graphs with a 2-separation ⋮ Zero forcing sets and the minimum rank of graphs ⋮ Minimum rank of skew-symmetric matrices described by a graph ⋮ Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization ⋮ On minimum rank and zero forcing sets of a graph ⋮ Techniques for determining the minimum rank of a small graph ⋮ Critical ideals, minimum rank and zero forcing number ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ The minimum rank problem for circulants ⋮ The minimum rank problem over the finite field of order 2: Minimum rank 3 ⋮ Achievable multiplicity partitions in the inverse eigenvalue problem of a graph ⋮ Lower bounds in minimum rank problems ⋮ Rational realizations of the minimum rank of a sign pattern matrix ⋮ On extremal graphs for zero forcing number
This page was built for publication: Graphs whose minimal rank is two
