Jason I. Brown

84 papers Journal 83Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the real reliability roots of graphs.
Discret. Appl. Math.
Jason I. Brown, Isaac McMullin
2024 J jnl
New approximations for network reliability.
Networks
Jason I. Brown, Theodore Kolokolnikov, Robert E. Kooij
2023 J jnl
Modulation Graphs in Popular Music.
CoRR
Jason I. Brown, Ian George
2023 J jnl
On the split reliability of graphs.
Networks
Jason I. Brown, Isaac McMullin
2022 J jnl
Maximal intervals of decrease and inflection points for node reliability.
Discret. Appl. Math.
Jason I. Brown
2022 J jnl
On the Unimodality of Domination Polynomials.
Graphs Comb.
Iain Beaton, Jason I. Brown
2021 J jnl
Network reliability: Heading out on the highway.
Networks
Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol
2021 J jnl
On the real roots of domination polynomials.
Contributions Discret. Math.
Jason I. Brown, Iain Beaton
2021 J jnl
Roots of two-terminal reliability polynomials.
Networks
Jason I. Brown, Corey D. C. DeGagné
2021 J jnl
The average order of dominating sets of a graph.
Discret. Math.
Iain Beaton, Jason I. Brown
2020 J jnl
A note on purely imaginary independence roots.
Discret. Math.
Jason I. Brown, Ben Cameron
2020 J jnl
Maximum Modulus of Independence Roots of Graphs and Trees.
Graphs Comb.
Jason I. Brown, Ben Cameron
2020 J jnl
On the imaginary parts of chromatic roots.
J. Graph Theory
Jason I. Brown, David G. Wagner
2020 J jnl
On the roots of the subtree polynomial.
Eur. J. Comb.
Jason I. Brown, Lucas Mol
2020 J jnl
Optimal Domination Polynomials.
Graphs Comb.
Iain Beaton, Jason I. Brown, Danielle Cox
2020 J jnl
Rational roots of all-terminal reliability.
Networks
Jason I. Brown, Corey D. C. DeGagné
2019 J jnl
(A) Data in the Life: Authorship Attribution of Lennon-McCartney Songs.
CoRR
Mark E. Glickman, Jason I. Brown, Ryan B. Song
2019 J jnl
Independence equivalence classes of paths and cycles.
Australas. J Comb.
Iain Beaton, Jason I. Brown, Ben Cameron
2019 J jnl
On the reliability roots of simplicial complexes and matroids.
Discret. Math.
Jason I. Brown, Corey D. C. DeGagné
2019 J jnl
The domination equivalence classes of paths.
Australas. J Comb.
Iain Beaton, Jason I. Brown
2018 J jnl
On the Stability of Independence Polynomials.
Electron. J. Comb.
Jason I. Brown, Ben Cameron
2018 J jnl
On the roots of Wiener polynomials of graphs.
Discret. Math.
Jason I. Brown, Lucas Mol, Ortrud R. Oellermann
2018 J jnl
On the unimodality of independence polynomials of very well-covered graphs.
Discret. Math.
Jason I. Brown, Ben Cameron
2018 J jnl
Optimal Graphs for Independence and
Graphs Comb.
Jason I. Brown, Danielle Cox
2018 J jnl
The shape of node reliability.
Discret. Appl. Math.
Jason I. Brown, Lucas Mol
2017 J jnl
On the roots of all-terminal reliability polynomials.
Discret. Math.
Jason I. Brown, Lucas Mol
2017 J jnl
Restraints permitting the largest number of colourings.
Discret. Appl. Math.
Jason I. Brown, Aysel Erey
2016 J jnl
Inflection points of reliability polynomials are dense in [0, 1].
Networks
Jason I. Brown, Danielle Cox
2016 J jnl
On the Real Roots of σ -Polynomials.
Graphs Comb.
Jason I. Brown, Aysel Erey
2016 J jnl
On the Roots of σ-Polynomials.
J. Graph Theory
Jason I. Brown, Aysel Erey
2016 J jnl
On the roots of the node reliability polynomial.
Networks
Jason I. Brown, Lucas Mol
2015 J jnl
New bounds for chromatic polynomials and chromatic roots.
Discret. Math.
Jason I. Brown, Aysel Erey
2015 J jnl
On the spectrum and number of convex sets in graphs.
Discret. Math.
Jason I. Brown, Ortrud R. Oellermann
2014 J jnl
A note on the real part of complex chromatic roots.
Discret. Math.
Jason I. Brown, Aysel Erey
2014 J jnl
Graphs with a Minimal Number of Convex Sets.
Graphs Comb.
Jason I. Brown, Ortrud R. Oellermann
2014 J jnl
Independence densities of hypergraphs.
Eur. J. Comb.
Anthony Bonato, Jason I. Brown, Dieter Mitsche, Pawel Pralat
2014 J jnl
Inflection points for network reliability.
Telecommun. Syst.
Jason I. Brown, Yakup Koç, Robert E. Kooij
2014 J jnl
Nonexistence of optimal graphs for all terminal reliability.
Networks
Jason I. Brown, Danielle Cox
2014 J jnl
On the Roots of Domination Polynomials.
Graphs Comb.
Jason I. Brown, Julia Tufts
2014 J jnl
The average reliability of a graph.
Discret. Appl. Math.
Jason I. Brown, Danielle Cox, Richard Ehrenborg
2013 J jnl
On the Roots of Expected Independence Polynomials.
J. Graph Theory
Jason I. Brown, Karl Dilcher, Dante V. Manna
2012 J jnl
Line Graphs and Circulants.
Ars Comb.
Jason I. Brown, Richard Hoshino
2012 J jnl
On Circulants Uniquely Characterized by their Independence Polynomials.
Ars Comb.
Jason I. Brown, Richard Hoshino
2011 — conf
Reliability polynomials crossing more than twice.
ICUMT
Jason I. Brown, Yakup Koc, Robert E. Kooij
2011 J jnl
Well-covered circulant graphs.
Discret. Math.
Jason I. Brown, Richard Hoshino
2010 J jnl
Proof of a conjecture on fractional Ramsey numbers.
J. Graph Theory
Jason I. Brown, Richard Hoshino
2009 J jnl
Chip firing and all-terminal network reliability bounds.
Discret. Optim.
Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski
2009 J jnl
Independence polynomials of circulants with an application to music.
Discret. Math.
Jason I. Brown, Richard Hoshino
2009 J jnl
Monomial bases for broken circuit complexes.
Eur. J. Comb.
Jason I. Brown, Bruce E. Sagan
2009 J jnl
Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers.
Discret. Math.
Jason I. Brown, R. Hoshino
2009 J jnl
On the roots of strongly connected reliability polynomials.
Networks
Jason I. Brown, Karl Dilcher
2009 J jnl
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane.
Discret. Math.
Jason I. Brown, Danielle Cox
2008 J jnl
The neighbourhood polynomial of a graph.
Australas. J Comb.
Jason I. Brown, Richard J. Nowakowski
2007 J jnl
The Ehrenfeucht-Fraisse Game for Paths and Cycles.
Ars Comb.
Jason I. Brown, Richard Hoshino
2007 J jnl
The structure of well-covered graphs with no cycles of length 4.
Discret. Math.
Jason I. Brown, Richard J. Nowakowski, Igor E. Zverovich
2007 J jnl
The well-covered dimension of random graphs.
Discret. Math.
Jason I. Brown, Richard J. Nowakowski
2007 J jnl
Uniformly optimal digraphs for strongly connected reliability.
Networks
Jason I. Brown, Xiaohu Li
2005 J jnl
Average independence polynomials.
J. Comb. Theory B
Jason I. Brown, Richard J. Nowakowski
2005 J jnl
The strongly connected reliability of complete digraphs.
Networks
Jason I. Brown, Xiaohu Li
2005 J jnl
Well-Covered Vector Spaces of Graphs.
SIAM J. Discret. Math.
Jason I. Brown, Richard J. Nowakowski
2004 J jnl
The
Discret. Math.
Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski
2003 J jnl
The independence fractal of a graph.
J. Comb. Theory B
Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski
2002 J jnl
On chromatic roots of large subdivisions of graphs.
Discret. Math.
Jason I. Brown, Carl A. Hickman
2002 J jnl
On chromatic roots with negative real part.
Ars Comb.
Jason I. Brown, Carl A. Hickman
2001 J jnl
Bounding the Roots of Independence Polynomials.
Ars Comb.
Jason I. Brown, Richard J. Nowakowski
2001 J jnl
On the Chromatic Roots of Generalized Theta Graphs.
J. Comb. Theory B
Jason I. Brown, Carl A. Hickman, Alan D. Sokal, David G. Wagner
1999 J jnl
Subdivisions and Chromatic Roots.
J. Comb. Theory B
Jason I. Brown
1998 J jnl
Chromatic polynomials and order ideals of monomials.
Discret. Math.
Jason I. Brown
1998 J jnl
On the Roots of Chromatic Polynomials.
J. Comb. Theory B
Jason I. Brown
1998 J jnl
The existence of uniquely -G colourable graphs.
Discret. Math.
Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael Molloy
1996 J jnl
Cohen-Macaulay Rings in Network Reliability.
SIAM J. Discret. Math.
Jason I. Brown, Charles J. Colbourn, David G. Wagner
1996 J jnl
The Complexity of Generalized Graph Colorings.
Discret. Appl. Math.
Jason I. Brown
1996 J jnl
The Ultimate Categorical Independence Ratio of a Graph.
SIAM J. Discret. Math.
Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall
1996 J jnl
The number of complements of a topology on n points is at least 2
Discret. Math.
Jason I. Brown, Stephen Watson
1993 J jnl
Mutually complementary partial orders.
Discret. Math.
Jason I. Brown, Stephen Watson
1993 J jnl
Network transformations and bounding network reliability.
Networks
Jason I. Brown, Charles J. Colbourn, John S. Devitt
1992 J jnl
A vertex critical graph without critical edges.
Discret. Math.
Jason I. Brown
1992 J jnl
Roots of the Reliability Polynomial.
SIAM J. Discret. Math.
Jason I. Brown, Charles J. Colbourn
1991 J jnl
A ramsey type problem concerning vertex colourings.
J. Comb. Theory B
Jason I. Brown, Vojtech Rödl
1991 J jnl
Graph properties and hypergraph colourings.
Discret. Math.
Jason I. Brown, Derek G. Corneil
1990 J jnl
A note on
J. Graph Theory
Jason I. Brown, Derek G. Corneil, Ali Ridha Mahjoub
1990 J jnl
Graph coloring satisfying restraints.
Discret. Math.
Jason I. Brown, David Kelly, Johanan Schönheim, Robert E. Woodrow
1988 J jnl
A Set System Polynomial with Colouring and Reliability Applications.
SIAM J. Discret. Math.
Jason I. Brown, Charles J. Colbourn
1987 J jnl
On generalized graph colorings.
J. Graph Theory
Jason I. Brown, Derek G. Corneil