default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShaun M. Fallat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Shaun M. Fallat
, Neha Joshi, Roghayeh Maleki, Karen Meagher, Seyed Ahmad Mojallal, Shahla Nasserasr, Mahsa N. Shirazi, Andriaherimanana Sarobidy Razafimahatratra, Brett Stevens:
The q-analogue of zero forcing for certain families of graphs. Discret. Appl. Math. 348: 91-104 (2024)- [j19]Honghai Li, Li Su, Shaun M. Fallat:
On a relationship between the characteristic and matching polynomials of a uniform hypertree. Discret. Math. 347(5): 113915 (2024) - [j18]Sarah Allred, Emelie Curl, Shaun M. Fallat, Shahla Nasserasr, Houston Schuerger, Ralihe R. Villagrán, Prateek K. Vishwakarma:
The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions. Graphs Comb. 40(1): 20 (2024) - [j17]Shaun M. Fallat, H. Tracy Hall, Rupert H. Levene, Seth A. Meyer, Shahla Nasserasr, Polona Oblak, Helena Smigoc:
Spectral arbitrariness for trees fails spectacularly. J. Comb. Theory B 169: 161-210 (2024) - [c3]Shaun M. Fallat, Valerii Maliuk, Seyed Ahmad Mojallal, Sandra Zilles:
Learning Hypertrees From Shortest Path Queries. ALT 2024: 574-589 - 2023
- [j16]Shaun M. Fallat, David G. Kirkpatrick, Hans Ulrich Simon, Abolghasem Soltani, Sandra Zilles:
On Batch Teaching Without Collusion. J. Mach. Learn. Res. 24: 40:1-40:33 (2023) - 2020
- [j15]Steve Butler, Craig Erickson, Shaun M. Fallat, H. Tracy Hall, Brenda Kroschel, Jephian C.-H. Lin, Bryan L. Shader, Nathan Warnberg, Boting Yang:
Properties of a q-Analogue of Zero Forcing. Graphs Comb. 36(5): 1401-1419 (2020) - [j14]Steve Butler, Craig Erickson, Shaun M. Fallat, H. Tracy Hall, Brenda Kroschel, Jephian C.-H. Lin, Bryan L. Shader, Nathan Warnberg, Boting Yang:
Correction to: Properties of a q-Analogue of Zero Forcing. Graphs Comb. 36(5): 1421-1422 (2020) - [j13]Wayne Barrett, Steve Butler, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Bryan L. Shader, Michael Young:
The inverse eigenvalue problem of a graph: Multiplicities and minors. J. Comb. Theory B 142: 276-306 (2020)
2010 – 2019
- 2019
- [j12]Mohammad Adm, Shaun M. Fallat:
The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic. Discret. Math. 342(10): 2924-2950 (2019) - 2018
- [j11]Ryan Bergen, Shaun M. Fallat, Adam Gorr, Ferdinand Ihringer, Karen Meagher, Alison Purdy, Boting Yang, Guanglong Yu:
Infection in hypergraphs. Discret. Appl. Math. 237: 43-56 (2018) - [j10]Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang:
Compressed cliques graphs, clique coverings and positive zero forcing. Theor. Comput. Sci. 734: 119-130 (2018) - 2017
- [j9]Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Bryan L. Shader:
Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph. Electron. J. Comb. 24(2): 2 (2017) - 2016
- [c2]Shaun M. Fallat, Karen Meagher, Abolghasem Soltani, Boting Yang:
Positive Zero Forcing and Edge Clique Coverings. FAW 2016: 53-64 - 2014
- [c1]Shaun M. Fallat, Karen Meagher, Boting Yang:
The Complexity of the Positive Semidefinite Zero Forcing. COCOA 2014: 681-693 - 2013
- [j8]Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben:
Note on Nordhaus-Gaddum Problems for Colin de Verdière type Parameters. Electron. J. Comb. 20(3): 56 (2013) - [j7]Francesco Barioli, Wayne Barrett, Shaun M. Fallat, H. Tracy Hall, Leslie Hogben, Bryan L. Shader, Pauline van den Driessche, Hein van der Holst:
Parameters Related to Tree-Width, Zero Forcing, and Maximum Nullity of a Graph. J. Graph Theory 72(2): 146-177 (2013)
2000 – 2009
- 2006
- [j6]Shaun M. Fallat, Allen Herman, Michael I. Gekhtman, Charles R. Johnson:
Compressions of Totally Positive Matrices. SIAM J. Matrix Anal. Appl. 28(1): 68-80 (2006) - 2005
- [j5]Shaun M. Fallat, Stephen J. Kirkland, Jason J. Molitierno, Michael Neumann:
On graphs whose Laplacian matrices have distinct integer eigenvalues. J. Graph Theory 50(2): 162-174 (2005) - 2003
- [j4]Shaun M. Fallat, Michael I. Gekhtman, Charles R. Johnson:
Multiplicative principal-minor inequalities for totally nonnegative matrices. Adv. Appl. Math. 30(3): 442-470 (2003) - 2002
- [j3]Shaun M. Fallat, Steve Kirkland, Sukanta Pati:
Minimizing algebraic connectivity over connected graphs with fixed girth. Discret. Math. 254(1-3): 115-142 (2002) - 2001
- [j2]Shaun M. Fallat:
Bidiagonal Factorizations of Totally Nonnegative Matrices. Am. Math. Mon. 108(8): 697-712 (2001) - 2000
- [j1]Shaun M. Fallat, Michael I. Gekhtman, Charles R. Johnson:
Spectral Structures of Irreducible Totally Nonnegative Matrices. SIAM J. Matrix Anal. Appl. 22(2): 627-645 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
