Shaun M. Fallat

Orcid: 0000-0002-7185-7357

According to our database1, Shaun M. Fallat authored at least 23 papers between 2000 and 2024.

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

2024
The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions.
Graphs Comb., February, 2024

Spectral arbitrariness for trees fails spectacularly.
J. Comb. Theory B, 2024

On a relationship between the characteristic and matching polynomials of a uniform hypertree.
Discret. Math., 2024

The q-analogue of zero forcing for certain families of graphs.
Discret. Appl. Math., 2024

Learning Hypertrees From Shortest Path Queries.
Proceedings of the International Conference on Algorithmic Learning Theory, 2024

2023
On Batch Teaching Without Collusion.
J. Mach. Learn. Res., 2023

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

Correction to: Properties of a q-Analogue of Zero Forcing.
Graphs Comb., 2020

Properties of a q-Analogue of Zero Forcing.
Graphs Comb., 2020

2019
The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic.
Discret. Math., 2019

2018
Compressed cliques graphs, clique coverings and positive zero forcing.
Theor. Comput. Sci., 2018

Infection in hypergraphs.
Discret. Appl. Math., 2018

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

2016
Positive Zero Forcing and Edge Clique Coverings.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2014
The Complexity of the Positive Semidefinite Zero Forcing.
Proceedings of the Combinatorial Optimization and Applications, 2014

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

2006
Compressions of Totally Positive Matrices.
SIAM J. Matrix Anal. Appl., 2006

2005
On graphs whose Laplacian matrices have distinct integer eigenvalues.
J. Graph Theory, 2005

2003
Multiplicative principal-minor inequalities for totally nonnegative matrices.
Adv. Appl. Math., 2003

2002
Minimizing algebraic connectivity over connected graphs with fixed girth.
Discret. Math., 2002

2001
Bidiagonal Factorizations of Totally Nonnegative Matrices.
Am. Math. Mon., 2001

2000
Spectral Structures of Irreducible Totally Nonnegative Matrices.
SIAM J. Matrix Anal. Appl., 2000


  Loading...