4 citations · 6 across the 5 of their papers we have counts for
5 papers
Pebbling on Graph Products and other Binary Graph Constructions
John Asplund, Glenn Hurlbert, Franklin Kenter
Pebbling on graphs is a two-player game which involves repeatedly moving a pebble from one vertex to another by removing another pebble from the first vertex. The pebbling number $…
It's good to be : a solution to a problem of Gosper and Knuth
Franklin H. J. Kenter
We present the solution to a problem presented by Knuth, attributed to Gosper.
On the error of a priori sampling: zero forcing sets and propagation time
Franklin H. J. Kenter, Jephian C. -H. Lin
Zero forcing is an iterative process on a graph used to bound the maximum nullity. The process begins with select vertices as colored, and the remaining vertices can become colored…
The relationship between -forcing and -power domination
Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter +1
Zero forcing and power domination are iterative processes on graphs where an initial set of vertices are observed, and additional vertices become observed based on some rules. In b…
A linear k-fold Cheeger inequality
Franklin Kenter, Mary Radcliffe
Given an undirected graph , the classical Cheeger constant, , measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon…