Pages that link to "Item:Q929488"

The following pages link to Three-connected graphs whose maximum nullity is at most three (Q929488):

Displaying 13 items.

• On the graph complement conjecture for minimum rank (Q417528) (← links)
• Computing inertia sets using atoms (Q417545) (← links)
• The minimum semidefinite rank of the complement of partial \(k\)-trees (Q627949) (← links)
• Maximum generic nullity of a graph (Q846315) (← links)
• Maximum nullity of outerplanar graphs and the path cover number (Q848586) (← links)
• On minimum rank and zero forcing sets of a graph (Q967512) (← links)
• Expected values of parameters associated with the minimum rank of a graph (Q972786) (← links)
• Lower bounds in minimum rank problems (Q1044621) (← links)
• The extremal function and Colin de Verdière graph parameter (Q1753124) (← links)
• On the Wiener index, distance cospectrality and transmission-regular graphs (Q2399284) (← links)
• Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
• Techniques for determining equality of the maximum nullity and the zero forcing number of a graph (Q4989750) (← links)