Leslie Hogben

Orcid: 0000-0003-1673-3789

According to our database1, Leslie Hogben authored at least 30 papers between 1981 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Isomorphisms and Properties of TAR Graphs for Zero Forcing and Other X-set Parameters.
Graphs Comb., August, 2023

Reconfiguration graphs of zero forcing sets.
Discret. Appl. Math., April, 2023

2022
Upper bounds for positive semidefinite propagation time.
Discret. Math., 2022

2020
The inverse eigenvalue problem of a graph: Multiplicities and minors.
J. Comb. Theory, Ser. B, 2020

Zero forcing and maximum nullity for hypergraphs.
Discret. Appl. Math., 2020

Skew throttling.
Australas. J Comb., 2020

2019
Restricted power domination and zero forcing problems.
J. Comb. Optim., 2019

Throttling positive semidefinite zero forcing propagation time on graphs.
Discret. Appl. Math., 2019

Cop throttling number: Bounds, values, and variants.
CoRR, 2019

Rigid Linkages and Partial Zero Forcing.
Electron. J. Comb., 2019

2018
The relationship between k-forcing and k-power domination.
Discret. Math., 2018

Throttling for the game of Cops and Robbers on graphs.
Discret. Math., 2018

Nordhaus-Gaddum problems for power domination.
Discret. Appl. Math., 2018

Propagation time for probabilistic zero forcing.
CoRR, 2018

2017
On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs.
J. Graph Theory, 2017

Note on power propagation time and lower bounds for the power domination number.
J. Comb. Optim., 2017

Zero forcing propagation time on oriented graphs.
Discret. Appl. Math., 2017

Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph.
Electron. J. Comb., 2017

2016
Reviews.
Am. Math. Mon., 2016

Fractional zero forcing via three-color forcing games.
Discret. Appl. Math., 2016

2015
Logic circuits from zero forcing.
Nat. Comput., 2015

2014
Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise.
IEEE Trans. Inf. Theory, 2014

2013
Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks.
IEEE Trans. Autom. Control., 2013

Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph.
J. Graph Theory, 2013

Note on Nordhaus-Gaddum Problems for Colin de Verdière type Parameters.
Electron. J. Comb., 2013

Recursive robust PCA or recursive sparse recovery in large but structured noise.
Proceedings of the IEEE International Conference on Acoustics, 2013

2012
Propagation time for zero forcing on a graph.
Discret. Appl. Math., 2012

2008
Applied Linear Algebra by Peter J. Olver; Chehrzad Shakiban.
Am. Math. Mon., 2008

Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers.
Electron. J. Comb., 2008

1981
Exhaustive Checking of Sparse Algebras.
J. Algorithms, 1981


  Loading...