1 citations · 2 across the 15 of their papers we have counts for
3 papers · 1 filter
Computer assisted discovery: Zero forcing vs vertex cover
Boris Brimkov, Randy Davila, Houston Schuerger +1
In this paper, we showcase the process of using an automated conjecturing program called \emph{TxGraffiti} written and maintained by the second author. We begin by proving a conjec…
Graphs which satisfy a Vizing-like bound for power domination of Cartesian products
Sarah E. Anderson, Kirsti Kuenzel, Houston Schuerger
Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph , a su…
Landscapes of the Tetrahedron and Cube: An Exploration of Shortest Paths on Polyhedra
Kenzie Fontenot, Erin Raign, August Sangalli +4
We consider the problem of determining the length of the shortest paths between points on the surfaces of tetrahedra and cubes. Our approach parallels the concept of Alexandrov's s…