Families of graphs with maximum nullity equal to zero forcing number

Families of graphs with maximum nullity equal to zero forcing number

The maximum nullity of a simple graph G, denoted M(G), is the largest possible nullity over all symmetric real matrices whose ijth entry is nonzero exactly when fi, jg is an edge in G for i =6 j, and the iith entry is any real number. The zero forcing number of a simple graph G, denoted Z(G), is the...

Full description

Bibliographic Details
Main Authors: Alameda Joseph S., Curl Emelie, Grez Armando, Hogben Leslie, Kingston O’Neill, Schulte Alex, Young Derek, Young Michael
Format: Article
Language:English
Published: De Gruyter 2018-02-01
Series:Special Matrices
Subjects:
zero forcing number
maximum nullity
semiregular bipartite graph
Generalized Petersen graph
05C50
15A03
15A18
Online Access:http://www.degruyter.com/view/j/spma.2018.6.issue-1/spma-2018-0006/spma-2018-0006.xml?format=INT

Internet

http://www.degruyter.com/view/j/spma.2018.6.issue-1/spma-2018-0006/spma-2018-0006.xml?format=INT

Similar Items