Wayne Barrett

Brigham Young University — United States

Mathematics · Physical Sciences

17h-index1.2kcitations91works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Graph theory and applications(45), Matrix Theory and Algorithms(39), Advanced Graph Theory Research(27), graph theory and CDMA systems(27), Graph Labeling and Dimension Problems(7)

Publications91 total

The classification of graphs on eight vertices with coinciding zero forcing number and maximum nullity
Electronic Journal of Linear Algebra·2025Open Access
The Classification of Graphs on $8$ vertices with Coinciding Zero Forcing number and Maximum Nullity
arXiv (Cornell University)·2025Open Access
Graphs with Bipartite Complement that Admit Two Distinct Eigenvalues
arXiv (Cornell University)·2024Open Access
Regular graphs of degree at most four that allow two distinct eigenvalues
Linear Algebra and its Applications·2023· 2 cited
Sparsity of graphs that allow two distinct eigenvalues
Linear Algebra and its Applications·2023· 1 cited
Regular Graphs of Degree at most Four that Allow Two Distinct Eigenvalues
arXiv (Cornell University)·2023· 1 citedOpen Access
On the Laplacian spread of digraphs
Linear Algebra and its Applications·2023· 1 cited
On the Laplacian spread of digraphs
arXiv (Cornell University)·2022Open Access
Sparsity of Graphs that Allow Two Distinct Eigenvalues
arXiv (Cornell University)·2022· 1 citedOpen Access
New conjectures on algebraic connectivity and the Laplacian spread of graphs
Linear Algebra and its Applications·2022· 3 cited
New conjectures on algebraic connectivity and the Laplacian spread of graphs
arXiv (Cornell University)·2022Open Access
Resistance distance and spanning 2-forest matrices of linear 2-trees
Linear Algebra and its Applications·2020· 10 cited
Spanning 2-forests and resistance distance in 2-connected graphs
Discrete Applied Mathematics·2020· 1 citedOpen Access
The inverse eigenvalue problem of a graph: Multiplicities and minors
Journal of Combinatorial Theory Series B·2019· 7 citedOpen Access
Resistance distance in straight linear 2-trees
Discrete Applied Mathematics·2018Open Access
Resistance distance in bent linear 2-trees
arXiv (Cornell University)·2017Open Access
Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph
The Electronic Journal of Combinatorics·2017· 7 citedOpen Access
Equitable decompositions of graphs with symmetries
Linear Algebra and its Applications·2016· 30 cited
Generalizations of the Strong Arnold Property and the minimum number of\n distinct eigenvalues of a graph
arXiv (Cornell University)·2015Open Access
Equitable Decompositions of Graphs
arXiv (Cornell University)·2015Open Access
page 1 of 5Next →

Frequent Co-authors

Charles R. Johnson(12), H. Tracy Hall(11), Shaun Fallat(8), Leslie Hogben(8), Raphael Loewy(7), Hein van der Holst(6), P. van den Driessche(5), Curtis Nelson(5), Bryan L. Shader(4), Steve Butler(4), Francesco Barioli(3), Philip Feinsilver(3), Michael Lundquist(3), John Sinkovic(3), Nicole Malloy(3), William Sexton(3), Mark Kempton(3), Amanda Francis(2), Kayla Owens(2), Tianyi Yang(2)