Jason I. Brown
Orcid: 0000000247218985Affiliations:
 Dalhousie University, Department of Mathematics and Statistics, Halifax, Canada
According to our database^{1},
Jason I. Brown
authored at least 82 papers
between 1987 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on orcid.org
On csauthors.net:
Bibliography
2023
Networks, September, 2023
CoRR, 2023
2022
Graphs Comb., 2022
Discret. Appl. Math., 2022
2021
Networks, 2021
Networks, 2021
Discret. Math., 2021
Contributions Discret. Math., 2021
2020
Networks, 2020
J. Graph Theory, 2020
Graphs Comb., 2020
Graphs Comb., 2020
Eur. J. Comb., 2020
Discret. Math., 2020
2019
Discret. Math., 2019
CoRR, 2019
Australas. J Comb., 2019
Australas. J Comb., 2019
2018
Graphs Comb., 2018
Discret. Math., 2018
Discret. Math., 2018
Discret. Appl. Math., 2018
Electron. J. Comb., 2018
2017
Discret. Math., 2017
Discret. Appl. Math., 2017
2016
Networks, 2016
Networks, 2016
J. Graph Theory, 2016
Graphs Comb., 2016
2015
Discret. Math., 2015
Discret. Math., 2015
2014
Telecommun. Syst., 2014
Networks, 2014
Graphs Comb., 2014
Graphs Comb., 2014
Eur. J. Comb., 2014
Discret. Math., 2014
Discret. Appl. Math., 2014
2013
J. Graph Theory, 2013
2012
Line Graphs and Circulants.
Ars Comb., 2012
On Circulants Uniquely Characterized by their Independence Polynomials.
Ars Comb., 2012
2011
Discret. Math., 2011
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011
2010
J. Graph Theory, 2010
2009
Networks, 2009
Eur. J. Comb., 2009
Discret. Math., 2009
Discret. Math., 2009
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane.
Discret. Math., 2009
Discret. Optim., 2009
2008
Australas. J Comb., 2008
2007
Networks, 2007
Discret. Math., 2007
Discret. Math., 2007
The EhrenfeuchtFraisse Game for Paths and Cycles.
Ars Comb., 2007
2005
SIAM J. Discret. Math., 2005
Networks, 2005
J. Comb. Theory B, 2005
2004
Discret. Math., 2004
2003
J. Comb. Theory B, 2003
2002
Discret. Math., 2002
On chromatic roots with negative real part.
Ars Comb., 2002
2001
J. Comb. Theory B, 2001
Bounding the Roots of Independence Polynomials.
Ars Comb., 2001
1999
J. Comb. Theory B, 1999
1998
J. Comb. Theory B, 1998
Discret. Math., 1998
Discret. Math., 1998
1996
SIAM J. Discret. Math., 1996
SIAM J. Discret. Math., 1996
The number of complements of a topology on n points is at least 2<sup>n</sup> (except for some special cases).
Discret. Math., 1996
Discret. Appl. Math., 1996
1993
Networks, 1993
Discret. Math., 1993
1992
SIAM J. Discret. Math., 1992
Discret. Math., 1992
1991
J. Comb. Theory B, 1991
Discret. Math., 1991
1990
J. Graph Theory, 1990
Discret. Math., 1990
1988
SIAM J. Discret. Math., 1988
1987
J. Graph Theory, 1987