Maximum nullity and zero forcing number on cubic graphs

Abstract

Let $G$ be a graph. The maximum nullity of $G$, denoted by $M(G)$, is defined to be the largest possible nullity over all real symmetric matrices $A$ whose $a_{ij}\ne 0$ for $i\ne j$, whenever two vertices $u_i$ and $u_j$ of $G$ are adjacent. In this paper, we characterize all cubic graphs with zero forcing number $3$. As a corollary, it is shown that if the zero forcing number is $3$, then $M(G)=3$. In addition, we introduce a family of cubic graphs containing graphs $G$ with $M(G)=Z(G)=4$. Also, we provide an algorithm which make a relation between maximum nullity of $G$ and the number of leaves in a spanning tree of $G$.

13 pages

Cited by in corpus (1)

• Maximum Nullity and Forcing Number on Graphs with Maximum Degree at most Three