Pages that link to "Item:Q3399125"
From MaRDI portal
The following pages link to The graphs for which the maximum multiplicity of an eigenvalue is two (Q3399125):
Displayed 17 items.
- Using a new zero forcing process to guarantee the strong Arnold property (Q306447) (← links)
- The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph (Q332633) (← links)
- A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535) (← links)
- On the minimum rank of a graph over finite fields (Q765180) (← links)
- Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379) (← links)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
- The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
- Signed graphs with stable maximum nullity at most two (Q2020682) (← links)
- On extremal graphs for zero forcing number (Q2102756) (← links)
- Two-connected signed graphs with maximum nullity at most two (Q2228486) (← links)
- On the Wiener index, distance cospectrality and transmission-regular graphs (Q2399284) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)
- Connected zero forcing sets and connected propagation time of graphs (Q5139339) (← links)
- Signed graphs with maximum nullity two (Q6168544) (← links)