Pages that link to "Item:Q947626"

The following pages link to An upper bound for the minimum rank of a graph (Q947626):

Displaying 44 items.

• Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
• On the graph complement conjecture for minimum rank (Q417528) (← links)
• On the minimum rank of the third power of a starlike tree (Q417547) (← links)
• The minimum rank of universal adjacency matrices (Q448355) (← links)
• Zero forcing sets and bipartite circulants (Q763073) (← links)
• On the minimum rank of a graph over finite fields (Q765180) (← links)
• Maximum generic nullity of a graph (Q846315) (← 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)
• Expected values of parameters associated with the minimum rank of a graph (Q972786) (← links)
• Lower bounds in minimum rank problems (Q1044621) (← links)
• Families of graphs with maximum nullity equal to zero forcing number (Q1642895) (← links)
• Graphs with real algebraic co-rank at most two (Q1668987) (← links)
• On order and rank of graphs (Q1701307) (← links)
• Bounds on expected propagation time of probabilistic zero forcing (Q1979443) (← links)
• On extremal graphs for zero forcing number (Q2102756) (← links)
• A linear time algorithm for the nullity of vertex-weighted block graphs (Q2161234) (← links)
• Nonsingular (vertex-weighted) block graphs (Q2185844) (← links)
• A short proof for a lower bound on the zero forcing number (Q2282488) (← links)
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs (Q2403987) (← links)
• Unitary matrix digraphs and minimum semidefinite rank (Q2477544) (← links)
• Some properties of the closed global shadow graphs and their zero forcing number (Q2674159) (← links)
• On the rank spread of graphs (Q2879639) (← links)
• On the minimum semidefinite rank of a simple graph (Q3006563) (← links)
• On the minimum vector rank of multigraphs (Q3075173) (← links)
• On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis (Q3476831) (← links)
• Minimum rank of a graph over an arbitrary field (Q3497884) (← links)
• Universally optimal matrices and field independence of the minimum rank of a graph (Q3559048) (← links)
• Minimum rank of edge subdivisions of graphs (Q3559060) (← links)
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
• The relationship between triangle size and minimum rank for <i>7</i> × <i>7</i> zero-nonzero patterns (Q5036729) (← links)
• Minimum-rank and maximum-nullity of graphs and their linear preservers (Q5080250) (← links)
• Matroids and the Minimum Rank Problem for Matrix Patterns (Q5127269) (← links)
• Bounds on minimum semidefinite rank of graphs (Q5175359) (← links)
• Maximum nullity and zero forcing number of graphs with rank at most 4 (Q5193233) (← links)
• On zero forcing number of graphs and their complements (Q5245854) (← links)
• Determining the minimum rank of matroids whose basis graph is common (Q5300997) (← links)
• (Q5509547) (← links)
• (Q5877175) (← links)
• The minimum rank problem for circulants (Q5962494) (← links)
• Graph degeneracy and orthogonal vector representations (Q6104068) (← links)
• Open global shadow graph and it’s zero forcing number (Q6168623) (← links)
• (Q6179673) (← links)
• Some Cayley graphs with propagation time of at most two (Q6585924) (← links)