default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBryan L. Shader
- > Home > Persons > Bryan L. Shader
Publications
- 2020
[j28]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)- [j27]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) - [j26]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) - 2019
- [j25]Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan L. Shader:
Rigid Linkages and Partial Zero Forcing. Electron. J. Comb. 26(2): 2 (2019) - 2017
- [j24]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) - 2013
- [j23]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) - 2008
- [j21]Avi Berman, Shmuel Friedland, Leslie Hogben, Uriel G. Rothblum, Bryan L. Shader:
Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers. Electron. J. Comb. 15(1) (2008) - 2007
- [j20]In-Jae Kim, D. Dale Olesky, Bryan L. Shader, Pauline van den Driessche:
Sign Patterns That Allow a Positive or Nonnegative Left Inverse. SIAM J. Matrix Anal. Appl. 29(2): 554-565 (2007) - 2005
- [j19]D. Dale Olesky, Bryan L. Shader, Pauline van den Driessche:
Permanents of Hessenberg (0, 1)-matrices. Electron. J. Comb. 12 (2005) - 2002
- [j17]Si-Ju Kim, Bryan L. Shader, Suk-Geun Hwang:
On Matrices with Signed Null-Spaces. SIAM J. Matrix Anal. Appl. 24(2): 570-580 (2002) - 2000
- [j16]Gi-Sang Cheon, Bryan L. Shader:
Sparse orthogonal matrices and the Haar wavelet. Discret. Appl. Math. 101(1-3): 63-76 (2000) - [j14]Gwang-Yeon Lee, Judith J. McDonald, Bryan L. Shader, Michael J. Tsatsomeros:
Extremal properties of ray-nonsingular matrices. Discret. Math. 216(1-3): 221-233 (2000) - [j13]Carolyn Eschenbach, Frank J. Hall, Rohan Hemasinha, Stephen Kirkland, Zhongshan Li, Bryan L. Shader, Jeffrey Stuart, James Weaver:
Properties of Tournaments among Well-Matched Players. Am. Math. Mon. 107(10): 881-892 (2000) - 1999
- [j12]Gi-Sang Cheon, Bryan L. Shader:
How Sparse Can a Matrix with Orthogonal Rows Be? J. Comb. Theory A 85(1): 29-40 (1999) - 1997
- [j8]Stephen J. Kirkland, Michael Neumann, Bryan L. Shader:
Distances in Weighted Trees and Group Inverse of Laplacian Matrices. SIAM J. Matrix Anal. Appl. 18(4): 827-841 (1997) - 1994
- [j6]Richard A. Brualdi, Keith L. Chavey, Bryan L. Shader:
Bipartite Graphs and Inverse Sign Patterns of Strong Sign-Nonsingular Matrices. J. Comb. Theory B 62(1): 133-150 (1994) - [j5]Richard A. Brualdi, Bryan L. Shader:
Strong Hall Matrices. SIAM J. Matrix Anal. Appl. 15(2): 359-365 (1994) - 1991
- [j3]Richard A. Brualdi, Bryan L. Shader:
Matrices of 0's and 1's with restricted permanental minors. Discret. Math. 96(3): 161-174 (1991) - [j2]Noga Alon, Richard A. Brualdi, Bryan L. Shader:
Multicolored forests in bipartite decompositions of graphs. J. Comb. Theory B 53(1): 143-148 (1991) - 1990
- [j1]Richard A. Brualdi, Bryan L. Shader:
Matrix factorizations of determinants and permanents. J. Comb. Theory A 54(1): 132-134 (1990) - [c1]Richard A. Brualdi, Bryan L. Shader:
On Sign-Nonsingular Matrices and the Conversion of the Permanent into the Determinant. Applied Geometry And Discrete Mathematics 1990: 117-134
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-09-09 01:13 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:
