Pages that link to "Item:Q2636506"
From MaRDI portal
The following pages link to Compressed cliques graphs, clique coverings and positive zero forcing (Q2636506):
Displayed 4 items.
- Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
- A New Lower Bound for Positive Zero Forcing (Q4632220) (← links)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)