SelectedWorks - Leslie Hogben

Contact

Selected Works of Leslie Hogben

Associate Dean and Professor of Mathematics

Leslie Hogben received her Ph.D. from Yale in mathematics under Nathan Jacobson in nonassociative ring theory and now does research in the areas of linear algebra and graph theory, specializing in combinatorial matrix theory.

Works
About

×

About Leslie Hogben

Leslie Hogben received her Ph.D. from Yale in mathematics under Nathan Jacobson in nonassociative ring theory and now does research in the areas of linear algebra and graph theory, specializing in combinatorial matrix theory.

Present	Professor, Iowa State University ‐ Department of Mathematics
Institution Organization Position Type Position Title Time Period to Options Current Position Affiliate my profile with this Institution

Algebra, Discrete Mathematics, Imaging and Signal Processing, Quantum Information, and Combinatorial matrix theory

488 Carver

411 Morrill Rd

Ames, IA 50011-2104

515-294-8168

Email:

Peer-Reviewed Articles (107)

Fractional Zero Forcing via Three-color Forcing Games

Discrete Applied Mathematics (2016)

Leslie Hogben, Kevin F. Palmowski, David E. Roberson and Michael Young

An r-fold analogue of the positive semidefinite zero forcing process that is carried out on the r-blowup of a graph ...

The Enhanced Principal Rank Characteristic Sequence

Linear Algebra and its Applications (2016)

Steve Butler, Minerva Catral, Shaun M. Fallat, H. Tracy Hall, et al.

The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric n×n matrix is a sequence ℓ1ℓ2⋯ℓn where ℓk is A, ...

On the Distance Spectra of Graphs

Linear Algebra and its Applications (2016)

Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy, Jay Cummings, et al.

The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. The distance eigenvalues of ...

Rainbow Arithmetic Progressions

Journal of Combinatorics (2016)

Steve Butler, Craig Erickson, Leslie Hogben, Kirsten Hogenson, et al.

In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers n ...

Logic circuits from zero forcing

Natural Computing (2015)

Daniel Burgarth, Vittorio Giovannetti, Leslie Hogben, Simone Severini, et al.

We design logic circuits based on the notion of zero forcing on graphs; each gate of the circuits is a ...

Note on the Jordan form of an irreducible eventually nonnegative ...

Electronic Journal of Linear Algebra (2015)

Leslie Hogben, Bit-Shun Tam and Ulrica Wilson

A square complex matrix A is eventually nonnegative if there exists a positive integer k(0) such that for all k ...

Minimum Rank of Graphs with Loops

Electronic Journal of Linear Algebra (2014)

Chassidy Bozeman, AnnaVictoria Ellsworth, Leslie Hogben, Jephian Chin-Hung Lin, et al.

A loop graph S is a finite undirected graph that allows loops but does not allow multiple edges. The set ...

The principal rank characteristic sequence over various fields

Linear Algebra and its Applications (2014)

Wayne Barrett, Steve Butler, Minerva Catral, Shaun M. Fallat, et al.

Given an n x n matrix, its principal rank characteristic sequence is a sequence of length n+1 of 0s and ...

Recursive Robust PCA or Recursive Sparse Recovery in Large but ...

IEEE Transactions on Information Theory (2014)

Chenlu Qiu, Namrata Vaswani, Brian Lois and Leslie Hogben

This paper studies the recursive robust principal components analysis problem. If the outlier is the signal-of-interest, this problem can be ...

Minimum rank with zero diagonal

Electronic Journal of Linear Algebra (2014)

Cheryl Grood, Johannes Harmse, Leslie Hogben, Thomas J. Hunter, et al.

Associated with a simple graph G is a family of real, symmetric zero diagonal matrices with the same nonzero pattern ...

The maximum nullity of a complete subdivision graph is equal ...

Electronic Journal of Linear Algebra (2014)

Wayne Barrett, Steve Butler, Minerva Catral, Shaun M. Fallat, et al.

Barrett et al. asked in [W. Barrett et al. Minimum rank of edge subdivisions of graphs. Electronic Journal of Linear ...

Minimum rank, maximum nullity, and zero forcing number of simple ...

Electronic Journal of Linear Algebra (2013)

Adam Berliner, Minerva Catral, Leslie Hogben, My Huynh, et al.

A simple digraph describes the off-diagonal zero-nonzero pattern of a family of (not necessarily symmetric) matrices. Minimum rank of a ...

Note on Nordhaus-Gaddum Problems for Colin de Verdière type Parameters

Electronic Journal of Combinatorics (2013)

Wayne Barrett, Shaun M. Fallat, H. Tracy Hall and Leslie Hogben

We establish the bounds 4 3 6 b 6 b 6 p 2, where b and b are the Nordhaus-Gaddum ...

Positive Semidefinite Zero Forcing

Linear Algebra and its Applications (2013)

Jason Ekstrand, Craig Erickson, H. Tracy Hall, Diana Hay, et al.

The positive semidefinite zero forcing number Z+(G) of a graph G was introduced in [4]. We establish a variety of ...

Zero Forcing, Linear and Quantum Controllability for Systems Evolving on ...

IEEE Transactions on Automatic Control (2013)

Daniel Burgarth, Domenico D'Alessandro, Leslie Hogben, Simone Severini, et al.

We study the dynamics of systems on networks from a linear algebraic perspective. The control theoretic concept of controllability describes ...

Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of ...

Journal of Graph Theory (2013)

Francesco Barioli, Wayne Barrett, Shaun M. Fallat, Leslie Hogben, et al.

Tree-width, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms and ...

Minimum rank, maximum nullity, and zero forcing number of simple ...

Electronic Journal of Linear Algebra (2013)

Adam Berliner, Minerva Catral, Leslie Hogben, My Huynh, et al.

Eventual properties of matrices

Electronic Journal of Linear Algebra (2012)

Leslie Hogben and Ulrica Wilson

An eventual property of a matrix M is an element of C-nxn is a property that holds for all powers ...

Zero forcing number, maximum nullity, and path cover number of ...

Electronic Journal of Linear Algebra (2012)

Minerva Catral, Anna Cepek, Leslie Hogben, My Huynh, et al.

The zero forcing number, maximum nullity and path cover number of a (simple, undirected) graph are parameters that are important ...

Zero forcing number, maximum nullity, and path cover number of ...

Electronic Journal of Linear Algebra (2012)

Minerva Catral, Anna Cepek, Leslie Hogben, My Huynh, et al.

The zero forcing number, maximum nullity and path cover number of a (simple, undirected) graph are parameters that are important ...

Propagation time for zero forcing on a graph

Discrete Applied Mathematics (2012)

Leslie Hogben, My Huynh, Nicole Kingsley, Sarah Meyer, et al.

Zero forcing (also called graph infection) on a simple, undirected graph G is based on the color-change rule: if each ...

Vertex and edge spread of zero forcing number, maximum nullity ...

Linear Algebra and its Applications (2012)

Christina J. Edholm, Leslie Hogben, My Huynh, Josh LaGrange, et al.

The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real ...

On the graph complement conjecture for minimum rank

Linear Algebra and its Applications (2012)

Francesco Barioli, Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, et al.

The minimum rank of a graph has been an interesting and well studied parameter investigated by many researchers over the ...

Note on positive semidefinite maximum nullity and positive semidefinite zero ...

Electronic Journal of Linear Algebra (2012)

J. Ekstrand, C. Erickson, D. Hay, L. Hogben, et al.

Note on positive semidefinite maximum nullity and positive semidefinite zero ...

Electronic Journal of Linear Algebra (2012)

Jason Ekstrand, Craig Erickson, Diana Hay, Leslie Hogben, et al.

The maximum positive semidefinite nullity of a multigraph G is the largest possible nullity over all real positive semidefinite matrices ...