Families of graphs with maximum nullity equal to zero forcing number

DOI10.1515/spma-2018-0006zbMath1391.05157OpenAlexW2797827892MaRDI QIDQ1642895

Y. Aharonov

Publication date: 15 June 2018

Published in: Special Matrices (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/spma-2018-0006

zbMATH Keywords

generalized Petersen graphmaximum nullityzero forcing numbersemiregular bipartite graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (5)

Techniques for determining equality of the maximum nullity and the zero forcing number of a graph ⋮ Maximum nullity and zero forcing of circulant graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities

Cites Work

• A technique for computing the zero forcing number of a graph with a cut-vertex
• Maximum nullity of outerplanar graphs and the path cover number
• An upper bound for the minimum rank of a graph
• Techniques for determining the minimum rank of a small graph
• Zero forcing parameters and minimum rank problems
• Computation of minimal rank and path cover number for certain graphs
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: Families of graphs with maximum nullity equal to zero forcing number