Jason I. Brown

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 31

Top Topics

Network Reliability

Algebraic Geometry

Conditional Independencies

Top Venues

Discret. Appl. Math.

Publications

Jason I. Brown, Ian George
Modulation Graphs in Popular Music. CoRR (2023)
Jason I. Brown, Isaac McMullin
On the split reliability of graphs. Networks 82 (2) (2023)
Jason I. Brown
Maximal intervals of decrease and inflection points for node reliability. Discret. Appl. Math. 313 (2022)
Iain Beaton, Jason I. Brown
On the Unimodality of Domination Polynomials. Graphs Comb. 38 (3) (2022)
Jason I. Brown, Iain Beaton
On the real roots of domination polynomials. Contributions Discret. Math. 16 (3) (2021)
Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol
Network reliability: Heading out on the highway. Networks 77 (1) (2021)
Iain Beaton, Jason I. Brown
The average order of dominating sets of a graph. Discret. Math. 344 (12) (2021)
Jason I. Brown, Corey D. C. DeGagné
Roots of two-terminal reliability polynomials. Networks 78 (2) (2021)
Jason I. Brown, Corey D. C. DeGagné
Rational roots of all-terminal reliability. Networks 76 (1) (2020)
Iain Beaton, Jason I. Brown, Danielle Cox
Optimal Domination Polynomials. Graphs Comb. 36 (5) (2020)
Jason I. Brown, Lucas Mol
On the roots of the subtree polynomial. Eur. J. Comb. 89 (2020)
Jason I. Brown, Ben Cameron
A note on purely imaginary independence roots. Discret. Math. 343 (12) (2020)
Jason I. Brown, Ben Cameron
Maximum Modulus of Independence Roots of Graphs and Trees. Graphs Comb. 36 (3) (2020)
Jason I. Brown, David G. Wagner
On the imaginary parts of chromatic roots. J. Graph Theory 93 (2) (2020)
Jason I. Brown, Corey D. C. DeGagné
On the reliability roots of simplicial complexes and matroids. Discret. Math. 342 (8) (2019)
Iain Beaton, Jason I. Brown
The domination equivalence classes of paths. Australas. J Comb. 73 (2019)
Mark E. Glickman, Jason I. Brown, Ryan B. Song
(A) Data in the Life: Authorship Attribution of Lennon-McCartney Songs. CoRR (2019)
Iain Beaton, Jason I. Brown, Ben Cameron
Independence equivalence classes of paths and cycles. Australas. J Comb. 75 (2019)
Jason I. Brown, Danielle Cox
-Independence Polynomials. Graphs Comb. 34 (6) (2018)
Jason I. Brown, Lucas Mol
The shape of node reliability. Discret. Appl. Math. 238 (2018)
Jason I. Brown, Ben Cameron
On the Stability of Independence Polynomials. Electron. J. Comb. 25 (1) (2018)
Jason I. Brown, Ben Cameron
On the unimodality of independence polynomials of very well-covered graphs. Discret. Math. 341 (4) (2018)
Jason I. Brown, Lucas Mol, Ortrud R. Oellermann
On the roots of Wiener polynomials of graphs. Discret. Math. 341 (9) (2018)
Jason I. Brown, Lucas Mol
On the roots of all-terminal reliability polynomials. Discret. Math. 340 (6) (2017)
Jason I. Brown, Aysel Erey
Restraints permitting the largest number of colourings. Discret. Appl. Math. 222 (2017)
Jason I. Brown, Danielle Cox
Inflection points of reliability polynomials are dense in [0, 1]. Networks 67 (4) (2016)
Jason I. Brown, Lucas Mol
On the roots of the node reliability polynomial. Networks 68 (3) (2016)
Jason I. Brown, Aysel Erey
On the Roots of σ-Polynomials. J. Graph Theory 82 (1) (2016)
Jason I. Brown, Aysel Erey
On the Real Roots of σ -Polynomials. Graphs Comb. 32 (5) (2016)
Jason I. Brown, Ortrud R. Oellermann
On the spectrum and number of convex sets in graphs. Discret. Math. 338 (7) (2015)
Jason I. Brown, Aysel Erey
New bounds for chromatic polynomials and chromatic roots. Discret. Math. 338 (11) (2015)
Anthony Bonato, Jason I. Brown, Dieter Mitsche, Pawel Pralat
Independence densities of hypergraphs. Eur. J. Comb. 40 (2014)
Jason I. Brown, Danielle Cox, Richard Ehrenborg
The average reliability of a graph. Discret. Appl. Math. 177 (2014)
Jason I. Brown, Ortrud R. Oellermann
Graphs with a Minimal Number of Convex Sets. Graphs Comb. 30 (6) (2014)
Jason I. Brown, Aysel Erey
A note on the real part of complex chromatic roots. Discret. Math. 328 (2014)
Jason I. Brown, Danielle Cox
Nonexistence of optimal graphs for all terminal reliability. Networks 63 (2) (2014)
Jason I. Brown, Yakup Koç, Robert E. Kooij
Inflection points for network reliability. Telecommun. Syst. 56 (1) (2014)
Jason I. Brown, Julia Tufts
On the Roots of Domination Polynomials. Graphs Comb. 30 (3) (2014)
Jason I. Brown, Karl Dilcher, Dante V. Manna
On the Roots of Expected Independence Polynomials. J. Graph Theory 73 (3) (2013)
Jason I. Brown, Richard Hoshino
On Circulants Uniquely Characterized by their Independence Polynomials. Ars Comb. 104 (2012)
Jason I. Brown, Richard Hoshino
Line Graphs and Circulants. Ars Comb. 105 (2012)
Jason I. Brown, Richard Hoshino
Well-covered circulant graphs. Discret. Math. 311 (4) (2011)
Jason I. Brown, Yakup Koc, Robert E. Kooij
Reliability polynomials crossing more than twice. ICUMT (2011)
Jason I. Brown, Richard Hoshino
Proof of a conjecture on fractional Ramsey numbers. J. Graph Theory 63 (2) (2010)
Jason I. Brown, R. Hoshino
Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers. Discret. Math. 309 (8) (2009)
Jason I. Brown, Danielle Cox
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane. Discret. Math. 309 (16) (2009)
Jason I. Brown, Karl Dilcher
On the roots of strongly connected reliability polynomials. Networks 54 (2) (2009)
Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski
Chip firing and all-terminal network reliability bounds. Discret. Optim. 6 (4) (2009)
Jason I. Brown, Richard Hoshino
Independence polynomials of circulants with an application to music. Discret. Math. 309 (8) (2009)
Jason I. Brown, Bruce E. Sagan
Monomial bases for broken circuit complexes. Eur. J. Comb. 30 (8) (2009)
Jason I. Brown, Richard J. Nowakowski
The neighbourhood polynomial of a graph. Australas. J Comb. 42 (2008)
Jason I. Brown, Richard Hoshino
The Ehrenfeucht-Fraisse Game for Paths and Cycles. Ars Comb. 83 (2007)
Jason I. Brown, Xiaohu Li
Uniformly optimal digraphs for strongly connected reliability. Networks 49 (2) (2007)
Jason I. Brown, Richard J. Nowakowski
The well-covered dimension of random graphs. Discret. Math. 307 (3-5) (2007)
Jason I. Brown, Richard J. Nowakowski, Igor E. Zverovich
The structure of well-covered graphs with no cycles of length 4. Discret. Math. 307 (17-18) (2007)
Jason I. Brown, Richard J. Nowakowski
Well-Covered Vector Spaces of Graphs. SIAM J. Discret. Math. 19 (4) (2005)
Jason I. Brown, Richard J. Nowakowski
Average independence polynomials. J. Comb. Theory, Ser. B 93 (2) (2005)
Jason I. Brown, Xiaohu Li
The strongly connected reliability of complete digraphs. Networks 45 (3) (2005)
Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski
-fractal of a simplicial complex. Discret. Math. 285 (1-3) (2004)
Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski
The independence fractal of a graph. J. Comb. Theory, Ser. B 87 (2) (2003)
Jason I. Brown, Carl A. Hickman
On chromatic roots with negative real part. Ars Comb. 63 (2002)
Jason I. Brown, Carl A. Hickman
On chromatic roots of large subdivisions of graphs. Discret. Math. 242 (1-3) (2002)
Jason I. Brown, Richard J. Nowakowski
Bounding the Roots of Independence Polynomials. Ars Comb. 58 (2001)
Jason I. Brown, Carl A. Hickman, Alan D. Sokal, David G. Wagner
On the Chromatic Roots of Generalized Theta Graphs. J. Comb. Theory, Ser. B 83 (2) (2001)
Jason I. Brown
Subdivisions and Chromatic Roots. J. Comb. Theory, Ser. B 76 (2) (1999)
Jason I. Brown
Chromatic polynomials and order ideals of monomials. Discret. Math. 189 (1-3) (1998)
Jason I. Brown
On the Roots of Chromatic Polynomials. J. Comb. Theory, Ser. B 72 (2) (1998)
Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael Molloy
The existence of uniquely -G colourable graphs. Discret. Math. 179 (1-3) (1998)
Jason I. Brown, Stephen Watson
(except for some special cases). Discret. Math. 154 (1-3) (1996)
Jason I. Brown
The Complexity of Generalized Graph Colorings. Discret. Appl. Math. 69 (3) (1996)
Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall
The Ultimate Categorical Independence Ratio of a Graph. SIAM J. Discret. Math. 9 (2) (1996)
Jason I. Brown, Charles J. Colbourn, David G. Wagner
Cohen-Macaulay Rings in Network Reliability. SIAM J. Discret. Math. 9 (3) (1996)
Jason I. Brown, Stephen Watson
Mutually complementary partial orders. Discret. Math. 113 (1-3) (1993)
Jason I. Brown, Charles J. Colbourn, John S. Devitt
Network transformations and bounding network reliability. Networks 23 (1) (1993)
Jason I. Brown, Charles J. Colbourn
Roots of the Reliability Polynomial. SIAM J. Discret. Math. 5 (4) (1992)
Jason I. Brown
A vertex critical graph without critical edges. Discret. Math. 102 (1) (1992)
Jason I. Brown, Vojtech Rödl
A ramsey type problem concerning vertex colourings. J. Comb. Theory, Ser. B 52 (1) (1991)
Jason I. Brown, Derek G. Corneil
Graph properties and hypergraph colourings. Discret. Math. 98 (2) (1991)
Jason I. Brown, Derek G. Corneil, Ali Ridha Mahjoub
-perfect graphs. J. Graph Theory 14 (3) (1990)
Jason I. Brown, David Kelly, Johanan Schönheim, Robert E. Woodrow
Graph coloring satisfying restraints. Discret. Math. 80 (2) (1990)
Jason I. Brown, Charles J. Colbourn
A Set System Polynomial with Colouring and Reliability Applications. SIAM J. Discret. Math. 1 (2) (1988)
Jason I. Brown, Derek G. Corneil
On generalized graph colorings. J. Graph Theory 11 (1) (1987)