Campus Units

Mathematics

Document Type

Article

Publication Version

Accepted Manuscript

Publication Date

8-15-2020

Journal or Book Title

Discrete Applied Mathematics

Volume

282

First Page

122

Last Page

135

DOI

10.1016/j.dam.2019.11.019

Abstract

The concept of zero forcing is extended from graphs to uniform hypergraphs in analogy with the way zero forcing was defined as an upper bound for the maximum nullity of the family of symmetric matrices whose nonzero pattern of entries is described by a given graph: A family of symmetric hypermatrices is associated with a uniform hypergraph and zeros are forced in a null vector. The value of the hypergraph zero forcing number and maximum nullity are determined for various families of uniform hypergraphs and the effects of several graph operations on the hypergraph zero forcing number are determined. The hypergraph zero forcing number is compared to the infection number of a hypergraph and the iteration process in hypergraph power domination.

Comments

This is a manuscript of an article published as Hogben, Leslie. "Zero forcing and maximum nullity for hypergraphs." 282 Discrete Applied Mathematics (2019): 122-135. DOI: 10.1016/j.dam.2019.11.019. Posted with permission.

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Copyright Owner

Elsevier B.V.

Language

en

File Format

application/pdf

Available for download on Monday, December 13, 2021

Published Version

Share

COinS