1 citations · 1 across the 3 of their papers we have counts for
4 papers
Reconfiguration of Minimum PSD Forcing Sets and Minimum Skew Forcing Sets
Novi Bong, Mary Flagg, Mark Hunnell +4
Reconfiguration graphs provide a way to represent relationships among solutions to a problem, and have been studied in many contexts. We investigate the reconfiguration graphs corr…
Some inner metric parameters of a digraph: Iterated line digraphs and integer sequences
N. H. Bong, C. Dalfó, M. A. Fiol +1
In this paper, we first give a new result characterizing the strongly connected digraphs with a diameter equal to that of their line digraphs. Then, we introduce the concepts of th…
Isomorphisms and properties of TAR reconfiguration graphs for zero forcing and other -set parameters
Novi H. Bong, Joshua Carlson, Bryan Curtis +2
An -TAR (token addition/removal) reconfiguration graph has as its vertices sets that satisfy some property , with an edge between two sets if one is obtained from the other b…
The Threshold Strong Dimension of a Graph
Nadia Benakli, Novi H Bong, Shonda M. Dueck +3
Let be a connected graph and and vertices of . Then is said to {\em strongly resolve} and , if there is either a shortest - path that contains …