Leslie Hogben
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
Research Interests
Leslie Hogben has a total of 149 co-authors. Here are the top co-authors by number of shared publications:
- Daniela Ferrero
Department of Mathematics, Texas State University, San Marcos, USA
11 shared publications - Michael E. Young
Department of Psychological Sciences, Kansas State University, Manhattan, USA
9 shared publications - Mary Flagg
Department of Mathematics, Statistics and Computer Science, University of St. Thomas, Houston, USA
7 shared publications - Carolyn Reinhart
Dept. of Mathematics Iowa State University Ames IA USA
5 shared publications - Franklin H. J. Kenter
Department of Mathematics, United States Naval Academy, Annapolis, USA
5 shared publications - Mark Hunnell
Winston-Salem State University
4 shared publications
Latest Publications
- 31 March 2026
- Published by Springer Nature in La Matematica
- Vol. 5 (2) , 28
TAR Reconfiguration for Vertex Set Parameters
- 31 March 2026
- Published by Springer Nature in La Matematica
- Vol. 5 (2) , 28
TAR Reconfiguration for Vertex Set Parameters
- Open Access
The Inverse Symplectic Eigenvalue Problem of a Graph
Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence for positive definite matrices is known as Williamson's theorem or decomposition. This notion of symplectic eigenvalues gives rise to inverse problems. We introduce the inverse symplectic eigenvalue problem for positive definite matrices described by a labeled graph and solve it for several families of labeled graphs and all labeled graphs of order four. To solve these problems we develop various tools such as the Strong Symplectic Spectral Property (SSSP) and its consequences such as the Supergraph Theorem, the Bifurcation Theorem, and the Matrix Liberation Lemma for symplectic eigenvalues, graph couplings to describe collections of labelings of a graph that produce the same symplectic eigenvalues, and coupled graph zero forcing. We establish numerous results for symplectic positive definite matrices, including a sharp lower bound on the number of nonzero entries of such a matrix (or equivalently, the number of edges in its graph). This lower bound is a consequence of a lower bound on the sum of number of nonzero entries in an irreducible positive definite matrix and its inverse.
Open AccessThe Inverse Symplectic Eigenvalue Problem of a Graph
Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence for positive definite matrices is known as Williamson's theorem or decomposition. This notion of symplectic eigenvalues gives rise to inverse problems. We introduce the inverse symplectic eigenvalue problem for positive definite matrices described by a labeled graph and solve it for several families of labeled graphs and all labeled graphs of order four. To solve these problems we develop various tools such as the Strong Symplectic Spectral Property (SSSP) and its consequences such as the Supergraph Theorem, the Bifurcation Theorem, and the Matrix Liberation Lemma for symplectic eigenvalues, graph couplings to describe collections of labelings of a graph that produce the same symplectic eigenvalues, and coupled graph zero forcing. We establish numerous results for symplectic positive definite matrices, including a sharp lower bound on the number of nonzero entries of such a matrix (or equivalently, the number of edges in its graph). This lower bound is a consequence of a lower bound on the sum of number of nonzero entries in an irreducible positive definite matrix and its inverse.
- Open Access
- 13 January 2026
- Published by Springer Nature in La Matematica
- Vol. 5 (1) , 8
Power Domination Reconfiguration
Reconfiguration examines relationships among solutions to a problem. Power domination models placement of monitoring units that allow monitoring of an entire electrical power network, and information about modifying one monitoring solution to another has applications. The study of token addition and removal and token jumping reconfiguration graphs for power domination is initiated. Some results established here can be extended by applying the methods used for power domination to reconfiguration graphs for other parameters. A universal framework for the study of reconfiguration of parameters that are defined from sets of vertices of a graph and satisfy certain rules is introduced. This allows application of some of the results to additional parameters such as domination and zero forcing.
- 13 January 2026
- Published by Springer Nature in La Matematica
- Vol. 5 (1) , 8
Open AccessPower Domination Reconfiguration
Reconfiguration examines relationships among solutions to a problem. Power domination models placement of monitoring units that allow monitoring of an entire electrical power network, and information about modifying one monitoring solution to another has applications. The study of token addition and removal and token jumping reconfiguration graphs for power domination is initiated. Some results established here can be extended by applying the methods used for power domination to reconfiguration graphs for other parameters. A universal framework for the study of reconfiguration of parameters that are defined from sets of vertices of a graph and satisfy certain rules is introduced. This allows application of some of the results to additional parameters such as domination and zero forcing.
- Open Access
Zero forcing propagation time intervals and graphs with fixed propagation time
Zero forcing in a graph refers to the evolution of vertex states under repeated application of a color change rule. Typically the states are chosen to be blue and white, and a forcing set is an initial set of blue vertices such that all of the vertices are blue at the end of the process. In this context, the propagation time of a set in a graph is the number of iterations of the color change rule required to have all vertices blue, performing independent color changes simultaneously. Different minimal forcing sets need not have the same propagation time, and we study the realizability of specific integers as propagation times of minimal forcing sets in graphs for two of the most well-studied color change rules (standard and positive semidefinite). Particular attention is paid to the case where all minimal forcing sets have the same propagation time, and we term this phenomenon fixed propagation time. For each of the two variants, we present a general form of graphs all of which have fixed propagation time equal to one. We conjecture that these are the only such graphs and prove the conjectures for joins of graphs. Families of graphs with longer fixed propagation time for standard forcing are exhibited, and it is shown that such graphs do not exist for positive semidefinite forcing.
Open AccessZero forcing propagation time intervals and graphs with fixed propagation time
Zero forcing in a graph refers to the evolution of vertex states under repeated application of a color change rule. Typically the states are chosen to be blue and white, and a forcing set is an initial set of blue vertices such that all of the vertices are blue at the end of the process. In this context, the propagation time of a set in a graph is the number of iterations of the color change rule required to have all vertices blue, performing independent color changes simultaneously. Different minimal forcing sets need not have the same propagation time, and we study the realizability of specific integers as propagation times of minimal forcing sets in graphs for two of the most well-studied color change rules (standard and positive semidefinite). Particular attention is paid to the case where all minimal forcing sets have the same propagation time, and we term this phenomenon fixed propagation time. For each of the two variants, we present a general form of graphs all of which have fixed propagation time equal to one. We conjecture that these are the only such graphs and prove the conjectures for joins of graphs. Families of graphs with longer fixed propagation time for standard forcing are exhibited, and it is shown that such graphs do not exist for positive semidefinite forcing.
- Open Access
Universal perspectives on irredundance for X-set parameters
Universal definitions of irredundance for X-set parameters are presented using blocking sets. This approach is modeled on (domination) irredundance (which uses closed neighborhoods as blocking sets) and zero forcing irredundance (which uses forts). Results include a chain of inequalities between irredundance parameters and original parameters and the isomorphism theorem for TAR reconfiguration graphs of many irredundance parameters. These results are then applied to PSD forcing irredundance and vertex cover irredundance; the chain of inequalities also applies to skew forcing irredundance. The upper vertex cover irredundance number becomes part of the Domination Chain used in the study of (domination) irredundance. Based on the propagation processes involved in forcing, an alternate universal theory of irredundance is developed using closure operators.
Open AccessUniversal perspectives on irredundance for X-set parameters
Universal definitions of irredundance for X-set parameters are presented using blocking sets. This approach is modeled on (domination) irredundance (which uses closed neighborhoods as blocking sets) and zero forcing irredundance (which uses forts). Results include a chain of inequalities between irredundance parameters and original parameters and the isomorphism theorem for TAR reconfiguration graphs of many irredundance parameters. These results are then applied to PSD forcing irredundance and vertex cover irredundance; the chain of inequalities also applies to skew forcing irredundance. The upper vertex cover irredundance number becomes part of the Domination Chain used in the study of (domination) irredundance. Based on the propagation processes involved in forcing, an alternate universal theory of irredundance is developed using closure operators.
- Open Access
- 11 April 2025
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (2) , P2.19
New Structures and their Applications to Variants of Zero Forcing and Propagation Time
We introduce a generalization of the concept of a chronological list of forces, called a relaxed chronology. This concept is used to introduce a new way of formulating the standard zero forcing process, which we refer to as parallel increasing path covers, or PIPs. The combinatorial properties of PIPs are utilized to identify bounds comparing standard zero forcing propagation time to positive semidefinite propagation time. A collection of paths within a set of PSD forcing trees, called a path bundle, is used to identify the PSD forcing analog of the reversal of a standard zero forcing process, as well as to draw a connection between PSD forcing and rigid-linkage forcing.
- 11 April 2025
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (2) , P2.19
Open AccessNew Structures and their Applications to Variants of Zero Forcing and Propagation Time
We introduce a generalization of the concept of a chronological list of forces, called a relaxed chronology. This concept is used to introduce a new way of formulating the standard zero forcing process, which we refer to as parallel increasing path covers, or PIPs. The combinatorial properties of PIPs are utilized to identify bounds comparing standard zero forcing propagation time to positive semidefinite propagation time. A collection of paths within a set of PSD forcing trees, called a path bundle, is used to identify the PSD forcing analog of the reversal of a standard zero forcing process, as well as to draw a connection between PSD forcing and rigid-linkage forcing.
- 22 August 2023
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 39, 434-459
Orthogonal realizations of random sign patterns and other applications of the SIPP
A sign pattern is an array with entries in $\{+,-,0\}$. A real matrix $Q$ is row orthogonal if $QQ^T = I$. The Strong Inner Product Property (SIPP), introduced in [B.A. Curtis and B.L. Shader, Sign patterns of orthogonal matrices and the strong inner product property, Linear Algebra Appl. 592: 228-259, 2020], is an important tool when determining whether a sign pattern allows row orthogonality because it guarantees there is a nearby matrix with the same property, allowing zero entries to be perturbed to nonzero entries, while preserving the sign of every nonzero entry. This paper uses the SIPP to initiate the study of conditions under which random sign patterns allow row orthogonality with high probability. Building on prior work, $5\times n$ nowhere zero sign patterns that minimally allow orthogonality are determined. Conditions on zero entries in a sign pattern are established that guarantee any row orthogonal matrix with such a sign pattern has the SIPP.- 22 August 2023
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 39, 434-459
Orthogonal realizations of random sign patterns and other applications of the SIPP
A sign pattern is an array with entries in $\{+,-,0\}$. A real matrix $Q$ is row orthogonal if $QQ^T = I$. The Strong Inner Product Property (SIPP), introduced in [B.A. Curtis and B.L. Shader, Sign patterns of orthogonal matrices and the strong inner product property, Linear Algebra Appl. 592: 228-259, 2020], is an important tool when determining whether a sign pattern allows row orthogonality because it guarantees there is a nearby matrix with the same property, allowing zero entries to be perturbed to nonzero entries, while preserving the sign of every nonzero entry. This paper uses the SIPP to initiate the study of conditions under which random sign patterns allow row orthogonality with high probability. Building on prior work, $5\times n$ nowhere zero sign patterns that minimally allow orthogonality are determined. Conditions on zero entries in a sign pattern are established that guarantee any row orthogonal matrix with such a sign pattern has the SIPP.- Open Access
New Structures and their Applications to Variants of Zero Forcing and Propagation Time
We introduce a generalization of the concept of a chronological list of forces, called a relaxed chronology. This concept is used to introduce a new way of formulating the standard zero forcing process, which we refer to as parallel increasing path covers, or PIPs. The combinatorial properties of PIPs are utilized to identify bounds comparing standard zero forcing propagation time to positive semidefinite propagation time. A collection of paths within a set of PSD forcing trees, called a path bundle, is used to identify the PSD forcing analog of the reversal of a standard zero forcing process, as well as to draw a connection between PSD forcing and rigid-linkage forcing.
Open AccessNew Structures and their Applications to Variants of Zero Forcing and Propagation Time
We introduce a generalization of the concept of a chronological list of forces, called a relaxed chronology. This concept is used to introduce a new way of formulating the standard zero forcing process, which we refer to as parallel increasing path covers, or PIPs. The combinatorial properties of PIPs are utilized to identify bounds comparing standard zero forcing propagation time to positive semidefinite propagation time. A collection of paths within a set of PSD forcing trees, called a path bundle, is used to identify the PSD forcing analog of the reversal of a standard zero forcing process, as well as to draw a connection between PSD forcing and rigid-linkage forcing.
- 19 July 2023
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 39 (4) , 1-23
Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters
- 19 July 2023
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 39 (4) , 1-23
Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters
- Open Access
- 8 June 2023
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 39, 307-326
Positive and negative square energies of graphs
The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Let $s^+(G), s^-(G)$ denote the sum of the squares of the positive and negative eigenvalues of $G$, respectively. It was conjectured by [Elphick, Farber, Goldberg, Wocjan, Discrete Math. (2016)] that if $G$ is a connected graph of order $n$, then $s^+(G)\geq n-1$ and $s^-(G) \geq n-1$. In this paper, we show partial results towards this conjecture. In particular, numerous structural results that may help in proving the conjecture are derived, including the effect of various graph operations. These are then used to establish the conjecture for several graph classes, including graphs with certain fraction of positive eigenvalues and unicyclic graphs.- 8 June 2023
- Published by University of Wyoming Libraries in The Electronic Journal of Linear Algebra
- Vol. 39, 307-326
Open AccessPositive and negative square energies of graphs
The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Let $s^+(G), s^-(G)$ denote the sum of the squares of the positive and negative eigenvalues of $G$, respectively. It was conjectured by [Elphick, Farber, Goldberg, Wocjan, Discrete Math. (2016)] that if $G$ is a connected graph of order $n$, then $s^+(G)\geq n-1$ and $s^-(G) \geq n-1$. In this paper, we show partial results towards this conjecture. In particular, numerous structural results that may help in proving the conjecture are derived, including the effect of various graph operations. These are then used to establish the conjecture for several graph classes, including graphs with certain fraction of positive eigenvalues and unicyclic graphs.