Techniques for determining equality of the maximum nullity and the zero forcing number of a graph

zbMath1464.05257arXiv1912.07302MaRDI QIDQ4989750

Derek S. Young

Publication date: 26 May 2021

Full work available at URL: https://arxiv.org/abs/1912.07302

zbMATH Keywords

equitable partitionmaximum nullitystrong Arnold propertyzero forcing numbernullity of a graphequitable decomposition

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable decompositions of graphs with symmetries
• Three-connected graphs whose maximum nullity is at most three
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• The minimum rank of symmetric matrices described by a graph: a survey
• A correction: Orthogonal representations and connectivity of graphs
• Families of graphs with maximum nullity equal to zero forcing number
• Orthogonal representations and connectivity of graphs
• Zero forcing sets and the minimum rank of graphs
• Circulants and their connectivities
• Graphs whose minimal rank is two
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
• Approximation Algorithms and Hardness for Domination with Propagation
• The minimum rank problem for circulants

This page was built for publication: Techniques for determining equality of the maximum nullity and the zero forcing number of a graph