Pages that link to "Item:Q929488"
From MaRDI portal
The following pages link to Three-connected graphs whose maximum nullity is at most three (Q929488):
Displayed 7 items.
- 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)
- Zero forcing sets and the minimum rank of graphs (Q2477541) (← links)