Pages that link to "Item:Q479006"

The following pages link to Upper bounds on the \(k\)-forcing number of a graph (Q479006):

Displaying 50 items.

• Fractional zero forcing via three-color forcing games (Q313806) (← links)
• Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
• Extremal values and bounds for the zero forcing number (Q317429) (← links)
• Zero forcing propagation time on oriented graphs (Q526815) (← links)
• Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379) (← links)
• Computational approaches for zero forcing and related problems (Q1631510) (← links)
• Some bounds on the zero forcing number of a graph (Q1693145) (← links)
• On a conjecture of Gentner and Rautenbach (Q1699556) (← links)
• Infection in hypergraphs (Q1701092) (← links)
• On the total forcing number of a graph (Q1730228) (← links)
• The relationship between \(k\)-forcing and \(k\)-power domination (Q1744766) (← links)
• Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
• Bounds on the connected forcing number of a graph (Q1756082) (← links)
• A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
• Total forcing versus total domination in cubic graphs (Q2011113) (← links)
• Complexity and computation of connected zero forcing (Q2012050) (← links)
• Zero forcing versus domination in cubic graphs (Q2025087) (← links)
• Note on forcing problem of trees (Q2062888) (← links)
• On extremal graphs for zero forcing number (Q2102756) (← links)
• On the zero forcing number and spectral radius of graphs (Q2121770) (← links)
• Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
• From the editor-in-chief (Q2226443) (← links)
• Grundy domination and zero forcing in regular graphs (Q2238998) (← links)
• On the nullity of a connected graph in terms of order and maximum degree (Q2244875) (← links)
• On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
• Zero forcing in claw-free cubic graphs (Q2302052) (← 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)
• Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
• On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
• Some properties of the closed global shadow graphs and their zero forcing number (Q2674159) (← links)
• The Zero Forcing Number of Graphs (Q4610449) (← links)
• The forcing number of graphs with given girth (Q4639236) (← links)
• Zero forcing number of a graph in terms of the number of pendant vertices (Q4965925) (← links)
• k-Forcing number for Cartesian product of some graphs (Q4986275) (← links)
• (Q5076794) (← links)
• Propagation time for probabilistic zero forcing (Q5090539) (← links)
• (Q5130665) (← links)
• Matching, path covers, and total forcing sets (Q5215393) (← links)
• Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← links)
• Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)
• UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS (Q6124016) (← links)
• On graphs maximizing the zero forcing number (Q6157420) (← links)
• Open global shadow graph and it’s zero forcing number (Q6168623) (← 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)
• Bounds on zero forcing using (upper) total domination and minimum degree (Q6601135) (← links)
• The zero (total) forcing number and covering number of trees (Q6614498) (← links)
• On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs (Q6633544) (← links)
• The zero forcing number of claw-free cubic graphs (Q6633547) (← links)