Pages that link to "Item:Q4908829"
From MaRDI portal
The following pages link to Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829):
Displaying 50 items.
- Using a new zero forcing process to guarantee the strong Arnold property (Q306447) (← links)
- Fractional zero forcing via three-color forcing games (Q313806) (← links)
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- On the graph complement conjecture for minimum semidefinite rank (Q551287) (← links)
- Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379) (← links)
- Positive semidefinite propagation time (Q897615) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- Infection in hypergraphs (Q1701092) (← 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)
- The extremal function and Colin de Verdière graph parameter (Q1753124) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
- Total forcing and zero forcing in claw-free cubic graphs (Q1756105) (← links)
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph (Q1801062) (← links)
- A lower bound on the zero forcing number (Q1801082) (← links)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
- The Colin de Verdière parameter, excluded minors, and the spectral radius (Q2000642) (← links)
- Rigid linkages and partial zero forcing (Q2001975) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
- On the zero forcing number and spectral radius of graphs (Q2121770) (← 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 Grundy total domination number in product graphs (Q2214319) (← links)
- Grundy domination and zero forcing in regular graphs (Q2238998) (← links)
- A short proof for a lower bound on the zero forcing number (Q2282488) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Positive semidefinite zero forcing numbers of two classes of graphs (Q2319902) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph (Q2363102) (← links)
- On the Wiener index, distance cospectrality and transmission-regular graphs (Q2399284) (← links)
- Orthogonal representations of Steiner triple system incidence graphs (Q2404398) (← links)
- The minimum rank of a sign pattern matrix with a 1-separation (Q2442438) (← links)
- Zero forcing for sign patterns (Q2451650) (← links)
- Compressed cliques graphs, clique coverings and positive zero forcing (Q2636506) (← links)
- Various characterizations of throttling numbers (Q2656957) (← links)
- Multi-color forcing in graphs (Q2657055) (← links)
- Some properties of the closed global shadow graphs and their zero forcing number (Q2674159) (← links)
- Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups (Q2794394) (← links)
- The Complexity of the Positive Semidefinite Zero Forcing (Q2942442) (← links)
- Positive Semidefinite Zero Forcing: Complexity and Lower Bounds (Q3449859) (← links)
- Positive Zero Forcing and Edge Clique Coverings (Q4632169) (← links)
- A New Lower Bound for Positive Zero Forcing (Q4632220) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED (Q4956465) (← links)
- Techniques for determining equality of the maximum nullity and the zero forcing number of a graph (Q4989750) (← links)
