Franklin H. J. Kenter
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Franklin H. J. Kenter has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Leslie Hogben
Department of Mathematics, Iowa State University, Ames, USA
5 shared publications - Aida Abiad
Tilburg University
3 shared publications - Daniela Ferrero
Department of Mathematics, Texas State University, San Marcos, USA
3 shared publications - Ghodratollah Aalipour
Department of Mathematics and Computer Sciences Kharazmi University 50 Taleghani St. Tehran Iran
3 shared publications - Michael E. Young
Department of Psychological Sciences, Kansas State University, Manhattan, USA
3 shared publications - Jephian C. -H. Lin
Department of Mathematics Iowa State University 50011 Ames IA USA
2 shared publications
Latest Publications
- 11 May 2026
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 42 (3) , 51
Zero Forcing on 2-connected Outerplanar Graphs
- 11 May 2026
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 42 (3) , 51
Zero Forcing on 2-connected Outerplanar Graphs
- Open Access
Leaky Forcing: Extending Zero Forcing Results to a Fault-Tolerant Setting
We study a recent variation of zero forcing called leaky forcing. Zero forcing is a propagation process on a network whereby some nodes are initially blue with all others white. Blue vertices can "force" a white neighbor to become blue if all other neighbors are blue. The goal is to find the minimum number of initially blue vertices to eventually force all vertices blue after exhaustively applying the forcing rule above. Leaky forcing is a fault-tolerant variation of zero forcing where certain vertices (not necessarily initially blue) cannot force. The goal in this context is to find the minimum number of initially blue vertices needed that can eventually force all vertices to be blue, regardless of which small number of vertices can't force. This work extends results from zero forcing in terms of leaky forcing. In particular, we provide a complete determination of leaky forcing numbers for all unicyclic graphs and upper bounds for generalized Petersen graphs. We also provide bounds for the effect of both edge removal and vertex removal on the $\ell$-leaky forcing number. Finally, we completely characterize connected graphs that have the minimum and maximum possible $1$-leaky forcing number (i.e., when $Z_{1}(G) = 2$ and when $Z_{1}(G) = |V(G)|-1$).Open AccessLeaky Forcing: Extending Zero Forcing Results to a Fault-Tolerant Setting
We study a recent variation of zero forcing called leaky forcing. Zero forcing is a propagation process on a network whereby some nodes are initially blue with all others white. Blue vertices can "force" a white neighbor to become blue if all other neighbors are blue. The goal is to find the minimum number of initially blue vertices to eventually force all vertices blue after exhaustively applying the forcing rule above. Leaky forcing is a fault-tolerant variation of zero forcing where certain vertices (not necessarily initially blue) cannot force. The goal in this context is to find the minimum number of initially blue vertices needed that can eventually force all vertices to be blue, regardless of which small number of vertices can't force. This work extends results from zero forcing in terms of leaky forcing. In particular, we provide a complete determination of leaky forcing numbers for all unicyclic graphs and upper bounds for generalized Petersen graphs. We also provide bounds for the effect of both edge removal and vertex removal on the $\ell$-leaky forcing number. Finally, we completely characterize connected graphs that have the minimum and maximum possible $1$-leaky forcing number (i.e., when $Z_{1}(G) = 2$ and when $Z_{1}(G) = |V(G)|-1$). - 1 May 2025
- Published by Human Kinetics in Journal of Sport Management
- Vol. 39 (3) , 210-221
Long-Term Viewership Forecasting of American College Football Games
Using data collected from televised college football games between 2014 and 2019, we present a log-linear statistical model for viewership of National Collegiate Athletic Association college football games that controls for well-known factors, such as temporal fixed effects, strength of the games, rivalries, outcome uncertainty, and broadcast medium, among others. Novel factors influencing viewership that are not used in previous studies include the number of concurrent broadcasts, the strength of the game relative to other concurrently broadcast games, and their interactions. This model only includes team-specific factors available prior to the season, thereby providing valuable input if games were to be scheduled well in advance. We also propose a novel variable coding that allows a parsimonious estimation of the effect of all pairs of interconference games, not just intraconference games. The model is assessed through residual analysis and in- and out-of-sample predictive performance.
- 1 May 2025
- Published by Human Kinetics in Journal of Sport Management
- Vol. 39 (3) , 210-221
Long-Term Viewership Forecasting of American College Football Games
Using data collected from televised college football games between 2014 and 2019, we present a log-linear statistical model for viewership of National Collegiate Athletic Association college football games that controls for well-known factors, such as temporal fixed effects, strength of the games, rivalries, outcome uncertainty, and broadcast medium, among others. Novel factors influencing viewership that are not used in previous studies include the number of concurrent broadcasts, the strength of the game relative to other concurrently broadcast games, and their interactions. This model only includes team-specific factors available prior to the season, thereby providing valuable input if games were to be scheduled well in advance. We also propose a novel variable coding that allows a parsimonious estimation of the effect of all pairs of interconference games, not just intraconference games. The model is assessed through residual analysis and in- and out-of-sample predictive performance.
- 21 April 2023
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 11 (3)
A geometric Chung–Lu model and the Drosophila medulla connectome
Many real-world graphs have edges correlated to the distance between them, but in an inhomogeneous manner. While the Chung–Lu model and the geometric random graph models both are elegant in their simplicity, they are insufficient to capture the complexity of these networks. In this article, we develop a generalized geometric random graph model that preserves many graph theoretic aspects of these real-world networks. We test the validity of this model on a graphical representation of the Drosophila medulla connectome.
- 21 April 2023
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 11 (3)
A geometric Chung–Lu model and the Drosophila medulla connectome
Many real-world graphs have edges correlated to the distance between them, but in an inhomogeneous manner. While the Chung–Lu model and the geometric random graph models both are elegant in their simplicity, they are insufficient to capture the complexity of these networks. In this article, we develop a generalized geometric random graph model that preserves many graph theoretic aspects of these real-world networks. We test the validity of this model on a graphical representation of the Drosophila medulla connectome.
- Open Access
An upper bound for the $k$-power domination number in $r$-uniform hypergraphs
Generalizing work on graphs, Chang and Roussel introduced $k$-power domination in hypergraphs and conjectured the upper bound for the $k$-power domination number for $r$-uniform hypergraphs on $n$ vertices was $\frac{n}{r+k}$. This upper bound was shown to be true for simple graphs ($r=2$) and it was further conjectured that only a family of hypergraphs, known as the squid hypergraphs, attained this upper bound. In this paper, the conjecture is proven to hold for hypergraphs with $r=3$ or $4$; but is shown to be false, by a counterexample, for $r\geq 7$. Furthermore, we show that the squid hypergraphs are not the only hypergraphs that attain the original upper bound. Finally, a new upper bound is proven for $r\geq 3$.Open AccessAn upper bound for the $k$-power domination number in $r$-uniform hypergraphs
Generalizing work on graphs, Chang and Roussel introduced $k$-power domination in hypergraphs and conjectured the upper bound for the $k$-power domination number for $r$-uniform hypergraphs on $n$ vertices was $\frac{n}{r+k}$. This upper bound was shown to be true for simple graphs ($r=2$) and it was further conjectured that only a family of hypergraphs, known as the squid hypergraphs, attained this upper bound. In this paper, the conjecture is proven to hold for hypergraphs with $r=3$ or $4$; but is shown to be false, by a counterexample, for $r\geq 7$. Furthermore, we show that the squid hypergraphs are not the only hypergraphs that attain the original upper bound. Finally, a new upper bound is proven for $r\geq 3$. - 1 January 2020
- Published by Elsevier in Theoretical Computer Science
- Vol. 803, 160-177
Computing bounds on product graph pebbling numbers
- 1 January 2020
- Published by Elsevier in Theoretical Computer Science
- Vol. 803, 160-177
Computing bounds on product graph pebbling numbers
- Open Access
Leaky Forcing: A New Variation of Zero Forcing
Zero forcing is a one-player game played on a graph. The player chooses some set of vertices to color, then iteratively applies a color change rule: If all but one of a colored vertex's neighbors are colored, color (i.e. "force") the remaining uncolored neighbor. Generally, the goal is to find the minimum number of vertices to initially color such that all vertices eventually become colored. Recently, equivalent formations of zero forcing have been developed in different settings including sensor allocation to solve linear systems (K.-Lin 2018), controllability in follower-leader dynamics (Monshizadeh-Zhang-Camlibel 2014), and edge covering in specific hypergraphs (Brimkov-Fast-Hicks 2016). While many variations of zero forcing are motivated by an associated minimum rank problem, these new formulations give new inspiration for new meaningful zero forcing variants. In our case, we study a new variation based on the linear algebraic interpretation mentioned above. In particular, what if there is a juncture in a network that has a leak, and, hence, is unreliable to facilitate solving a linear system on the network? In the context of zero forcing this corresponds to the following variation we call $\ell$-forcing: Given $\ell$, find a set of vertices such that for any set of $\ell$ vertices that are unable to force, all vertices will still be colored. We compute the $\ell$-forcing number for selected families of graphs including grid graphs. Perhaps surprisingly, we find examples where additional edges make the graph more "resilient" to these leaks. Further, we also implement known computational methods for our new leaky forcing variation.Open AccessLeaky Forcing: A New Variation of Zero Forcing
Zero forcing is a one-player game played on a graph. The player chooses some set of vertices to color, then iteratively applies a color change rule: If all but one of a colored vertex's neighbors are colored, color (i.e. "force") the remaining uncolored neighbor. Generally, the goal is to find the minimum number of vertices to initially color such that all vertices eventually become colored. Recently, equivalent formations of zero forcing have been developed in different settings including sensor allocation to solve linear systems (K.-Lin 2018), controllability in follower-leader dynamics (Monshizadeh-Zhang-Camlibel 2014), and edge covering in specific hypergraphs (Brimkov-Fast-Hicks 2016). While many variations of zero forcing are motivated by an associated minimum rank problem, these new formulations give new inspiration for new meaningful zero forcing variants. In our case, we study a new variation based on the linear algebraic interpretation mentioned above. In particular, what if there is a juncture in a network that has a leak, and, hence, is unreliable to facilitate solving a linear system on the network? In the context of zero forcing this corresponds to the following variation we call $\ell$-forcing: Given $\ell$, find a set of vertices such that for any set of $\ell$ vertices that are unable to force, all vertices will still be colored. We compute the $\ell$-forcing number for selected families of graphs including grid graphs. Perhaps surprisingly, we find examples where additional edges make the graph more "resilient" to these leaks. Further, we also implement known computational methods for our new leaky forcing variation. - 1 September 2019
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 576, 124-141
On the error of a priori sampling: Zero forcing sets and propagation time
- 1 September 2019
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 576, 124-141
On the error of a priori sampling: Zero forcing sets and propagation time
- 1 June 2018
- Published by Elsevier in Discrete Mathematics
- Vol. 341 (6) , 1789-1797
The relationship between -forcing and -power domination- 1 June 2018
- Published by Elsevier in Discrete Mathematics
- Vol. 341 (6) , 1789-1797
The relationship between -forcing and -power domination- 21 February 2018
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 34, 373-380
Proof of a Conjecture of Graham and Lovasz concerning Unimodality of Coefficients of the Distance Characteristic Polynomial of a Tree
The conjecture of Graham and Lov Ìasz that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal is proved; it is also shown that the (normalized) coefficients are log-concave. Upper and lower bounds on the location of the peak are established.
- 21 February 2018
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 34, 373-380
Proof of a Conjecture of Graham and Lovasz concerning Unimodality of Coefficients of the Distance Characteristic Polynomial of a Tree
The conjecture of Graham and Lov Ìasz that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal is proved; it is also shown that the (normalized) coefficients are log-concave. Upper and lower bounds on the location of the peak are established.