2 citations · 3 across the 3 of their papers we have counts for
4 papers
On the zero forcing number of the complement of graphs with forbidden subgraphs
Emelie Curl, Shaun Fallat, Ryan Moruzzi +2
Motivated in part by an observation that the zero forcing number for the complement of a tree on vertices is either or in one exceptional case, we consider the zero…
Inverse eigenvalue and related problems for hollow matrices described by graphs
F. Scott Dahlgren, Zachary Gershkoff, Leslie Hogben +2
A hollow matrix described by a graph is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in .…
Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
Derek Young
It is known that the zero forcing number of a graph is an upper bound for the maximum nullity of the graph. In this paper, we search for characteristics of a graph that guarantee t…
Lower Bounds for the Exponential Domination Number of
Chassidy Bozeman, Joshua Carlson, Michael Dairyko +2
A vertex in a porous exponential dominating set assigns weight to vertex . A porous exponential dominating set of a graph is a su…