Graphs whose minimal rank is two
From MaRDI portal
Recommendations
Cited in
(61)- Lower bounds in minimum rank problems
- Graphs with real algebraic co-rank at most two
- Computation of minimal rank and path cover number for certain graphs
- On extremal graphs for zero forcing number
- Subgraph complementation and minimum rank
- On the minimum semidefinite rank of signed graphs
- Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
- Graphs with few trivial characteristic ideals
- Critical ideals, minimum rank and zero forcing number
- Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
- Positive semidefinite zero forcing
- The inverse inertia problem for the complements of partial \(k\)-trees
- Graphs that allow all the eigenvalue multiplicities to be even
- The minimum rank of matrices and the equivalence class graph
- The maximum corank of graphs with a 2-separation
- Zero forcing sets and the minimum rank of graphs
- Rational realizations of the minimum rank of a sign pattern matrix
- The inertia set of a signed graph
- Maximum nullity and zero forcing of circulant graphs
- The inverse eigenvalue and inertia problems for minimum rank two graphs
- The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
- On minimal rank over finite fields
- Decompositions of minimum rank matrices
- Bounds for minimum semidefinite rank from superpositions and cutsets
- On the graph complement conjecture for minimum rank
- Computing inertia sets using atoms
- scientific article; zbMATH DE number 6873977 (Why is no real title available?)
- Graphs whose minimal rank is two: The finite fields case
- Fractional minimal rank
- Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- Diagonal entry restrictions in minimum rank matrices
- The minimum rank problem for circulants
- Sparks of symmetric matrices and their graphs
- The minimum semidefinite rank of the complement of partial \(k\)-trees
- The inertia set of the join of graphs
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- On the zero forcing number of the complement of graphs with forbidden subgraphs
- A bound on the rank of weighted graphs in terms of girth
- The classification of graphs on eight vertices with coinciding zero forcing number and maximum nullity
- Signed graphs G^ with nullity n(G^) - g(G^) -1
- Relation between the H-rank of a mixed graph and the girth of its underlying graph
- Zero forcing irredundant sets
- Linearly independent vertices and minimum semidefinite rank
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- Minimum rank problems
- Minimal regular 2-graphs and applications
- Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
- Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture
- On the minimum rank of the join of graphs and decomposable graphs
- Forbidden minors for the class of graphs G with (G) 2
- Orthogonal representations, minimum rank, and graph complements
- Three-connected graphs whose maximum nullity is at most three
- On acyclic and unicyclic graphs whose minimum rank equals the diameter
- An upper bound for the minimum rank of a graph
- Minimum rank of skew-symmetric matrices described by a graph
- On minimum rank and zero forcing sets of a graph
- Techniques for determining the minimum rank of a small graph
- The minimum rank of symmetric matrices described by a graph: a survey
- The minimum rank problem over the finite field of order 2: Minimum rank 3
This page was built for publication: Graphs whose minimal rank is two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4656572)
