Pages that link to "Item:Q2564937"
From MaRDI portal
The following pages link to Minimum-rank matrices with prescribed graph (Q2564937):
Displaying 45 items.
- Decompositions of minimum rank matrices (Q389662) (← links)
- Minimum rank of outerplanar graphs (Q417506) (← links)
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph (Q417526) (← links)
- On the minimum rank of the third power of a starlike tree (Q417547) (← links)
- Minimum rank and path cover number for generalized and double generalized cycle star graphs (Q725515) (← links)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
- Minimum rank problems (Q848577) (← links)
- Maximum nullity of outerplanar graphs and the path cover number (Q848586) (← links)
- The number of connected components in a graph associated with a rectangular \((0,1)\)-matrix (Q890553) (← links)
- The structure of matrices with a maximum multiplicity eigenvalue (Q932157) (← links)
- On acyclic and unicyclic graphs whose minimum rank equals the diameter (Q947619) (← links)
- A note on universally optimal matrices and field independence of the minimum rank of a graph (Q977476) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- The minimum rank problem over the finite field of order 2: Minimum rank 3 (Q999773) (← links)
- Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers (Q1010731) (← links)
- Smith normal form and acyclic matrices (Q1016142) (← links)
- Null space structure of tree-patterned matrices (Q1307564) (← links)
- On the rank of a matrix associated with a graph. (Q1422421) (← links)
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree (Q1601616) (← links)
- Computation of minimal rank and path cover number for certain graphs (Q1887507) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic (Q2317668) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- Positive semidefinite zero forcing (Q2435453) (← links)
- The minimum rank of matrices and the equivalence class graph (Q2459958) (← links)
- The maximum corank of graphs with a 2-separation (Q2477537) (← links)
- Unitary matrix digraphs and minimum semidefinite rank (Q2477544) (← links)
- On the difference between the maximum multiplicity and path cover number for tree-like graphs (Q2568981) (← links)
- Rational realizations of the minimum rank of a sign pattern matrix (Q2568989) (← links)
- Line graphs: Their maximum nullities and zero forcing numbers (Q2828813) (← links)
- On the rank spread of graphs (Q2879639) (← links)
- On the minimum semidefinite rank of a simple graph (Q3006563) (← links)
- Connection matrices (Q3447287) (← links)
- Minimum rank of a graph over an arbitrary field (Q3497884) (← links)
- On the edge degrees of trees (Q3654357) (← links)
- Average mixing matrix of trees (Q4568088) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)
- Minimum-rank and maximum-nullity of graphs and their linear preservers (Q5080250) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- Bounds on minimum semidefinite rank of graphs (Q5175359) (← links)
- Minimum rank of graphs with loops (Q5501716) (← links)
- Sparks of symmetric matrices and their graphs (Q6202068) (← links)
- Reconstruction from one labelled card and more (Q6536720) (← links)
- Spectral arbitrariness for trees fails spectacularly (Q6615753) (← links)
