On the singularity of graphs: zero forcing parameters

MaRDI QIDQ2829368zbMATH OpenFDO

Authors Irene Triantafillou

Publication date 27 October 2016

Published in Bulletin of the Greek Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

maximaum nullitynull spreadzero forcing number

Mathematics Subject Classification ID

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

Review text

In this paper, the author gives bounds on the nullity of a graph that is, the multiplicity of the eigenvalue zero. The author uses the zero forcing number to obtain an upper bound of the nullity and she gives some characterizations of when equality happens. The author gives also some examples where equality occurs.

Recommendations

• Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
• On the nullity of graphs
• On the nullity number of graphs
• Zero forcing parameters and minimum rank problems
• A technique for computing the zero forcing number of a graph with a cut-vertex

Cited in

(4)

• From the editor-in-chief
• Using variants of zero forcing to bound the inertia set of a graph
• Asymptotic structure and singularities in constrained directed graphs
• Techniques for determining equality of the maximum nullity and the zero forcing number of a graph

This page was built for publication: On the singularity of graphs: zero forcing parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829368)