8 citations · 26 across the 23 of their papers we have counts for
7 papers · 1 filter
Power propagation time and lower bounds for power domination number
Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter +1
We present a counterexample to a lower bound for the power domination number given in Liao, Power domination with bounded time constraints, J. Comb. Optim. 31 (2016)725-742. We als…
On the Principal Permanent Rank Characteristic Sequences of Graphs and Digraphs
Keivan Hassani Monfared, Paul Horn, Franklin H. J. Kenter +3
The principal permanent rank characteristic sequence is a binary sequence where if there exists a principal square submatrix of size with nonzero…
On the distance spectra of graphs
Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +8
The distance matrix of a graph is the matrix containing the pairwise distances between vertices. The distance eigenvalues of are the eigenvalues of its distance matrix and…
Lower Bounds on the Distance Domination Number of a Graph
Randy Davila, Caleb Fast, Michael Henning +1
For an integer , a (distance) -dominating set of a connected graph is a set of vertices of such that every vertex of is at distance at mo…
Interception in Distance-Vector Routing Networks
David Burstein, Franklin Kenter, Jeremy Kun +1
Despite the large effort devoted to cybersecurity research over the last decades, cyber intrusions and attacks are still increasing. With respect to routing networks, route hijacki…
Proof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree
Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +4
We establish a conjecture of Graham and Lovász that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal; we also prove they are log-conca…
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…