The following pages link to Logic circuits from zero forcing (Q2003480):
Displaying 25 items.
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- Zero forcing number, Grundy domination number, and their variants (Q1713312) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Note on forcing problem of trees (Q2062888) (← links)
- On extremal graphs for zero forcing number (Q2102756) (← links)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- On the nullity of a connected graph in terms of order and maximum degree (Q2244875) (← links)
- A short proof for a lower bound on the zero forcing number (Q2282488) (← links)
- Zero forcing number of degree splitting graphs and complete degree splitting graphs (Q2305124) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- Some properties of the closed global shadow graphs and their zero forcing number (Q2674159) (← links)
- On the universality of the quantum approximate optimization algorithm (Q2681661) (← links)
- GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED (Q4956465) (← links)
- k-Forcing number for Cartesian product of some graphs (Q4986275) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- Zero forcing in Benzenoid network (Q5142119) (← links)
- On graphs maximizing the zero forcing number (Q6157420) (← links)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
- Bounding the total forcing number of graphs (Q6181334) (← links)
