Mark Hunnell

Mark Hunnell

Auto-generated profile, based on publicly available information

Mark Hunnell

Winston-Salem State University

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 April 2025 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
LHLeslie Hogben
Leslie Hogben
MHMark Hunnell
Mark Hunnell
KLKevin Liu
Kevin Liu
HSHouston Schuerger
Houston Schuerger
BSBen Small
Ben Small
YZYaqi Zhang
Yaqi Zhang
We introduce a generalization of the concept of a chronological list of forces, called a relaxed chronology. This concept is used to introduce a new way of formulating the standard zero forcing process, which we refer to as parallel increasing path covers, or PIPs. The combinatorial properties of PIPs are utilized to identify bounds comparing standard zero forcing propagation time to positive semidefinite propagation time. A collection of paths within a set of PSD forcing trees, called a path bundle, is used to identify the PSD forcing analog of the reversal of a standard zero forcing process, as well as to draw a connection between PSD forcing and rigid-linkage forcing.

9 May 2022 in Discrete Mathematics
Verified
Journal Article
Closed access
LHLeslie Hogben
Leslie Hogben
MHMark Hunnell
Mark Hunnell
KLKevin Liu
Kevin Liu
HSHouston Schuerger
Houston Schuerger
BSBen Small
Ben Small
YZYaqi Zhang
Yaqi Zhang

25 July 2020 in Journal of Algebra and Its Applications
Verified
Journal Article
Closed access
PDF file
MHMark Hunnell
Mark Hunnell

20 July 2023 in arXiv
Verified
Preprint
Open access
PDF file
LHLeslie Hogben
Leslie Hogben
MHMark Hunnell
Mark Hunnell
KLKevin Liu
Kevin Liu
HSHouston Schuerger
Houston Schuerger
BSBen Small
Ben Small
YZYaqi Zhang
Yaqi Zhang
We introduce a generalization of the concept of a chronological list of forces, called a relaxed chronology. This concept is used to introduce a new way of formulating the standard zero forcing process, which we refer to as parallel increasing path covers, or PIPs. The combinatorial properties of PIPs are utilized to identify bounds comparing standard zero forcing propagation time to positive semidefinite propagation time. A collection of paths within a set of PSD forcing trees, called a path bundle, is used to identify the PSD forcing analog of the reversal of a standard zero forcing process, as well as to draw a connection between PSD forcing and rigid-linkage forcing.

2 December 2025 in The Electronic Journal of Linear Algebra
Verified
Journal Article
Closed access
WBWayne Barrett
Wayne Barrett
MHMark Hunnell
Mark Hunnell
JHJohn Hutchens
John Hutchens
JSJohn Sinkovic
John Sinkovic
This article studies the minimum rank of a (simple, undirected) graph, which is the minimum rank among all matrices in a space determined by the graph. It determines the exact set of graphs on eight vertices for which the nullity of a minimum rank matrix does not coincide with a bound determined by the zero forcing number of a graph. Although the goal was to determine which eight-vertex graphs satisfy maximum nullity equal to the zero forcing number, it also establishes several additional methods to assist in the computation of minimum rank for general graphs.

7 February 2020 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
MHMark Hunnell
Mark Hunnell
JHJohn Hutchens
John Hutchens
NSNathaniel Schwartz
Nathaniel Schwartz