World's Best Scientists 2026 revealed!
Shaun M. Fallat

Shaun M. Fallat

Overview

Shaun M. Fallat is affiliated with the University of Regina in Canada. Their research spans both computer science and mathematics, focusing extensively on computational theory and discrete mathematics, with specific attention to matrix theory, graph theory, and related algorithmic studies.

Their publication record includes contributions to various academic journals and venues, notably:

  • arXiv (Cornell University)
  • Linear Algebra and its Applications
  • Graphs and Combinatorics
  • Banach Journal of Mathematical Analysis
  • Discrete Mathematics

Fallat's work addresses advanced topics including matrix theory and algorithms, graph theory and its applications, graph labeling, finite group theory, and limits and structures within graph theory. Their research also covers specialized areas such as graph theory applied to CDMA systems and advanced graph theory research.

Their frequent collaborators reflect longstanding research partnerships and include:

  • Shahla Nasserasr
  • Jephian C.-H. Lin
  • Veronika Furst
  • Karen Meagher
  • Seyed Ahmad Mojallal

Among Fallat's recent publications are:

  • "The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph," 2022, Linear Algebra and its Applications
  • "The Inverse Eigenvalue Problem of a Graph, Zero Forcing, and Related Parameters," 2020, Notices of the American Mathematical Society
  • "On a relationship between the characteristic and matching polynomials of a uniform hypertree," 2024, Discrete Mathematics
  • "Weakly Hadamard diagonalizable graphs," 2020, Linear Algebra and its Applications
  • "The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings," 2021, Algebraic Combinatorics

These publications illustrate Fallat's focus on algebraic combinatorics and matrix analysis within the context of graph theory, exploring eigenvalue problems and properties of graph structures.

Best Publications

  • Zero forcing sets and the minimum rank of graphs

    Francesco Barioli;Wayne Barrett;Steve Butler;Sebastian M. Cioabă

  • Totally Nonnegative Matrices

    Shaun M. Fallat;Charles R. Johnson

  • The minimum rank of symmetric matrices described by a graph: A survey☆

    Shaun M. Fallat;Leslie Hogben

  • Zero forcing parameters and minimum rank problems

    Francesco Barioli;Wayne Barrett;Shaun M. Fallat;H. Tracy Hall

  • On the normalized Laplacian energy and general Randić index R-1 of graphs

    Michael Cavers;Shaun Fallat;Steve Kirkland;Steve Kirkland

  • Extremizing algebraic connectivity subject to graph theoretic constraints

    Shaun Fallat;Steve Kirkland

  • Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph

    Francesco Barioli;Wayne Barrett;Shaun M. Fallat;H. Tracy Hall

  • Computation of minimal rank and path cover number for certain graphs

    Francesco Barioli;Shaun Fallat;Leslie Hogben

  • Bidiagonal Factorizations of Totally Nonnegative Matrices

    Shaun M. Fallat

  • Skew-adjacency matrices of graphs

    M. Cavers;S.M. Cioabă;S. Fallat;D.A. Gregory

  • Sub-direct sums and positivity classes of matrices

    Shaun M. Fallat;Charles R. Johnson

  • Total positivity in Markov structures

    Shaun Fallat;Steffen Lauritzen;Kayvan Sadeghi;Caroline Uhler

  • Perron components and algebraic connectivity for weighted graphs

    Steve Kirkland;Shaun Fallat

  • On the minimum rank of not necessarily symmetric matrices : a preliminary study

    Francesco Barioli;Shaun M. Fallat;H. Tracy Hall;Daniel Hershkowitz

  • Minimum Rank, Maximum Nullity, and Zero Forcing Number of Graphs

    Shaun M. Fallat;Leslie Hogben

  • Bipartiteness and the least eigenvalue of signless Laplacian of graphs

    Shaun Fallat;Yi-Zheng Fan;Yi-Zheng Fan

  • Variants on the minimum rank problem: A survey II

    Shaun M. Fallat;Leslie Hogben

  • A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs

    Francesco Barioli;Shaun Fallat;Leslie Hogben

  • Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph

    Wayne Barrett;Shaun M. Fallat;H. Tracy Hall;Leslie Hogben

  • Minimizing algebraic connectivity over connected graphs with fixed girth

    Shaun M. Fallat;Steve Kirkland;Sukanta Pati

Frequent Co-Authors

Leslie Hogben
Leslie Hogben Iowa State University
Charles R. Johnson
Charles R. Johnson William & Mary
P. van den Driessche
P. van den Driessche University of Victoria
Alan D. Sokal
Alan D. Sokal New York University
Michael Neumann
Michael Neumann University of Connecticut
Steffen L. Lauritzen
Steffen L. Lauritzen University of Copenhagen
Nanny Wermuth
Nanny Wermuth Chalmers University of Technology
Chi-Kwong Li
Chi-Kwong Li William & Mary
Willem H. Haemers
Willem H. Haemers Tilburg University
Chris Godsil
Chris Godsil University of Waterloo

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For those studying Mathematics in the USA, exploring related online degrees can open diverse career opportunities. Many students consider broadening their expertise by pursuing business-related programs that complement their analytical skills.

If you seek flexible options that balance quality and ease of admission, checking out the easiest mba program options is a good starting point. These programs offer accessible entry requirements without compromising educational value.

Additionally, the easiest mba programs provide a curated list of online degrees designed for busy professionals aiming to enhance leadership and management skills alongside their math background.

For advanced career growth, pursuing affordable doctorate degrees is key. The cheapest dba online programs offer cost-effective pathways to boost research, strategic analysis, and executive capabilities.

Moreover, students interested in finance-related roles may benefit from the cheapest online master's in finance, which combines mathematical rigor with practical financial applications, preparing graduates for high-demand positions in the finance sector.

Best Scientists Citing Shaun M. Fallat

Trending Scientists

Recently Published Articles