Pages that link to "Item:Q2477541"
From MaRDI portal
The following pages link to Zero forcing sets and the minimum rank of graphs (Q2477541):
Displaying 50 items.
- On the distance spectra of graphs (Q254892) (← links)
- Using a new zero forcing process to guarantee the strong Arnold property (Q306447) (← links)
- Fractional zero forcing via three-color forcing games (Q313806) (← links)
- Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
- Failed skew zero forcing on a graph (Q314747) (← links)
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph (Q332633) (← links)
- Bounds for minimum semidefinite rank from superpositions and cutsets (Q389675) (← links)
- Minimum rank of outerplanar graphs (Q417506) (← links)
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph (Q417526) (← links)
- On the graph complement conjecture for minimum rank (Q417528) (← links)
- A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535) (← links)
- On the minimum rank of the third power of a starlike tree (Q417547) (← links)
- Propagation time for zero forcing on a graph (Q442213) (← links)
- The minimum rank of universal adjacency matrices (Q448355) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- Zero forcing propagation time on oriented graphs (Q526815) (← links)
- The minimum semidefinite rank of the complement of partial \(k\)-trees (Q627949) (← links)
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs (Q649553) (← links)
- Throttling for the game of cops and robbers on graphs (Q724850) (← links)
- On the complexity of failed zero forcing (Q729899) (← links)
- Zero forcing sets and bipartite circulants (Q763073) (← links)
- Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
- Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379) (← links)
- Power domination in regular claw-free graphs (Q777411) (← links)
- On the relationship between the zero forcing number and path cover number for some graphs (Q779727) (← links)
- Minimum rank problems (Q848577) (← links)
- Positive semidefinite propagation time (Q897615) (← links)
- Orthogonal representations, minimum rank, and graph complements (Q924328) (← links)
- An upper bound for the minimum rank of a graph (Q947626) (← links)
- Minimum rank of skew-symmetric matrices described by a graph (Q962078) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← links)
- Techniques for determining the minimum rank of a small graph (Q967515) (← links)
- Zero forcing parameters and minimum rank problems (Q975607) (← links)
- A note on universally optimal matrices and field independence of the minimum rank of a graph (Q977476) (← links)
- Lower bounds in minimum rank problems (Q1044621) (← links)
- Nordhaus-Gaddum problems for power domination (Q1627850) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Families of graphs with maximum nullity equal to zero forcing number (Q1642895) (← links)
- Graphs with real algebraic co-rank at most two (Q1668987) (← links)
- Note on power propagation time and lower bounds for the power domination number (Q1680484) (← 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)
- Zero forcing number, Grundy domination number, and their variants (Q1713312) (← links)
- Throttling positive semidefinite zero forcing propagation time on graphs (Q1720308) (← links)
- Zero forcing in iterated line digraphs (Q1727740) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
