Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Bong, Novi H."'
An $X$-TAR (token addition/removal) reconfiguration graph has as its vertices sets that satisfy some property $X$, with an edge between two sets if one is obtained from the other by adding or removing one element. This paper considers the $X$-TAR gra
Externí odkaz:
http://arxiv.org/abs/2205.09668
Autor:
Benakli, Nadia, Bong, Novi H, Dueck, Shonda M., Eroh, Linda, Novick, Beth, Oellermann, Ortrud R.
Let $G$ be a connected graph and $u,v$ and $w$ vertices of $G$. Then $w$ is said to {\em strongly resolve} $u$ and $v$, if there is either a shortest $u$-$w$ path that contains $v$ or a shortest $v$-$w$ path that contains $u$. A set $W$ of vertices o
Externí odkaz:
http://arxiv.org/abs/2008.04282
Autor:
Bong, Novi H.1 (AUTHOR), Carlson, Joshua2 (AUTHOR), Curtis, Bryan3 (AUTHOR) bcurtis1@iastate.edu, Haas, Ruth4 (AUTHOR), Hogben, Leslie3,5 (AUTHOR)
Publikováno v:
Graphs & Combinatorics. Aug2023, Vol. 39 Issue 4, p1-23. 23p.
Autor:
Benakli, Nadia, Bong, Novi H., Dueck, Shonda, Eroh, Linda, Novick, Beth, Oellermann, Ortrud R.
Publikováno v:
In Discrete Mathematics July 2021 344(7)
Autor:
Bong, Novi H.
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics December 2017 14(3):251-260
Publikováno v:
Journal of Interconnection Networks. Sep/Dec2017, Vol. 17 Issue 3/4, p-1. 14p.
Autor:
Bong, Novi H.
Publikováno v:
AKCE International Journal of Graphs and Combinatorics; December 2017, Vol. 14 Issue: 3 p251-260, 10p