Pages that link to "Item:Q1887507"

The following pages link to Computation of minimal rank and path cover number for certain graphs (Q1887507):

Displaying 43 items.

• Graph reduction techniques and the multiplicity of the Laplacian eigenvalues (Q277144) (← links)
• 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)
• Computing inertia sets using atoms (Q417545) (← 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)
• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns (Q855530) (← links)
• On the minimum rank of the join of graphs and decomposable graphs (Q869896) (← links)
• On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle (Q869912) (← links)
• Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\) (Q876301) (← links)
• Orthogonal representations, minimum rank, and graph complements (Q924328) (← links)
• On acyclic and unicyclic graphs whose minimum rank equals the diameter (Q947619) (← links)
• An upper bound for the minimum rank of a graph (Q947626) (← links)
• Minimum rank of skew-symmetric matrices described by a graph (Q962078) (← links)
• On minimum rank and zero forcing sets of a graph (Q967512) (← links)
• Techniques for determining the minimum rank of a small graph (Q967515) (← links)
• Zero forcing parameters and minimum rank problems (Q975607) (← 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)
• Families of graphs with maximum nullity equal to zero forcing number (Q1642895) (← links)
• Approximating the minimum rank of a graph via alternating projection (Q1785758) (← links)
• The inverse eigenvalue problem of a graph: multiplicities and minors (Q1985452) (← links)
• Complexity and computation of connected zero forcing (Q2012050) (← links)
• On extremal graphs for zero forcing number (Q2102756) (← 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)
• The minimum rank of a sign pattern matrix with a 1-separation (Q2442438) (← links)
• The minimum rank of matrices and the equivalence class graph (Q2459958) (← links)
• The maximum corank of graphs with a 2-separation (Q2477537) (← links)
• Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)
• On the difference between the maximum multiplicity and path cover number for tree-like graphs (Q2568981) (← links)
• Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups (Q2794394) (← links)
• On the rank spread of graphs (Q2879639) (← links)
• On the minimum semidefinite rank of a simple graph (Q3006563) (← links)
• The graphs for which the maximum multiplicity of an eigenvalue is two (Q3399125) (← 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)
• Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)