2 citations · 3 across the 17 of their papers we have counts for
4 papers · 1 filter
Properties of a -analogue of zero forcing
Steve Butler, Craig Erickson, Shaun Fallat +6
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation…
Rigid linkages and partial zero forcing
Daniela Ferrero, Mary Flagg, H. Tracy Hall +5
Connections between vital linkages and zero forcing are established. Specifically, the notion of a rigid linkage is introduced as a special kind of unique linkage and it is shown t…
The sepr-sets of sign patterns
Leslie Hogben, Jephian C. -H. Lin, D. D. Olesky +1
Given a real symmetric matrix, the sepr-sequence records information about the existence of principal minors of each order that are positive, negative,…
On the distance matrices of the CP graphs
Yen-Jen Cheng, Jephian C. -H. Lin
This paper introduces a new class of graphs, the CP graphs, and shows that their distance determinant and distance inertia are independent of their structures. The CP graphs includ…