Pages that link to "Item:Q2568981"

The following pages link to On the difference between the maximum multiplicity and path cover number for tree-like graphs (Q2568981):

Displaying 13 items.

• A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535) (← links)
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
• Maximum nullity of outerplanar graphs and the path cover number (Q848586) (← links)
• On the minimum rank of the join of graphs and decomposable graphs (Q869896) (← links)
• Orthogonal representations, minimum rank, and graph complements (Q924328) (← links)
• On acyclic and unicyclic graphs whose minimum rank equals the diameter (Q947619) (← links)
• The minimum rank of symmetric matrices described by a graph: a survey (Q996311) (← links)
• Complexity and computation of connected zero forcing (Q2012050) (← links)
• On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
• Connected power domination in graphs (Q2424811) (← links)
• The minimum rank of matrices and the equivalence class graph (Q2459958) (← links)
• Line graphs: Their maximum nullities and zero forcing numbers (Q2828813) (← links)
• Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771) (← links)