Jason I. Brown

According to our database, Jason I. Brown authored at least 82 papers between 1987 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

On the split reliability of graphs.

Jason I. Brown, Isaac McMullin

Networks, September, 2023

Modulation Graphs in Popular Music.

Jason I. Brown, Ian George

CoRR, 2023

2022

On the Unimodality of Domination Polynomials.

Iain Beaton, Jason I. Brown

Graphs Comb., 2022

Maximal intervals of decrease and inflection points for node reliability.

Jason I. Brown

Discret. Appl. Math., 2022

2021

Roots of two-terminal reliability polynomials.

Jason I. Brown, Corey D. C. DeGagné

Networks, 2021

Network reliability: Heading out on the highway.

Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol

Networks, 2021

The average order of dominating sets of a graph.

Iain Beaton, Jason I. Brown

Discret. Math., 2021

On the real roots of domination polynomials.

Jason I. Brown, Iain Beaton

Contributions Discret. Math., 2021

2020

Rational roots of all-terminal reliability.

Jason I. Brown, Corey D. C. DeGagné

Networks, 2020

On the imaginary parts of chromatic roots.

Jason I. Brown, David G. Wagner

J. Graph Theory, 2020

Maximum Modulus of Independence Roots of Graphs and Trees.

Jason I. Brown, Ben Cameron

Graphs Comb., 2020

Optimal Domination Polynomials.

Iain Beaton, Jason I. Brown, Danielle Cox

Graphs Comb., 2020

On the roots of the subtree polynomial.

Jason I. Brown, Lucas Mol

Eur. J. Comb., 2020

A note on purely imaginary independence roots.

Jason I. Brown, Ben Cameron

Discret. Math., 2020

2019

On the reliability roots of simplicial complexes and matroids.

Jason I. Brown, Corey D. C. DeGagné

Discret. Math., 2019

(A) Data in the Life: Authorship Attribution of Lennon-McCartney Songs.

Mark E. Glickman, Jason I. Brown, Ryan B. Song

CoRR, 2019

Independence equivalence classes of paths and cycles.

Iain Beaton, Jason I. Brown, Ben Cameron

Australas. J Comb., 2019

The domination equivalence classes of paths.

Iain Beaton, Jason I. Brown

Australas. J Comb., 2019

2018

Optimal Graphs for Independence and <i>k</i>-Independence Polynomials.

Jason I. Brown, Danielle Cox

Graphs Comb., 2018

On the roots of Wiener polynomials of graphs.

Jason I. Brown, Lucas Mol, Ortrud R. Oellermann

Discret. Math., 2018

On the unimodality of independence polynomials of very well-covered graphs.

Jason I. Brown, Ben Cameron

Discret. Math., 2018

The shape of node reliability.

Jason I. Brown, Lucas Mol

Discret. Appl. Math., 2018

On the Stability of Independence Polynomials.

Jason I. Brown, Ben Cameron

Electron. J. Comb., 2018

2017

On the roots of all-terminal reliability polynomials.

Jason I. Brown, Lucas Mol

Discret. Math., 2017

Restraints permitting the largest number of colourings.

Jason I. Brown, Aysel Erey

Discret. Appl. Math., 2017

2016

On the roots of the node reliability polynomial.

Jason I. Brown, Lucas Mol

Networks, 2016

Inflection points of reliability polynomials are dense in [0, 1].

Jason I. Brown, Danielle Cox

Networks, 2016

On the Roots of σ-Polynomials.

Jason I. Brown, Aysel Erey

J. Graph Theory, 2016

On the Real Roots of σ -Polynomials.

Jason I. Brown, Aysel Erey

Graphs Comb., 2016

2015

On the spectrum and number of convex sets in graphs.

Jason I. Brown, Ortrud R. Oellermann

Discret. Math., 2015

New bounds for chromatic polynomials and chromatic roots.

Jason I. Brown, Aysel Erey

Discret. Math., 2015

2014

Inflection points for network reliability.

Jason I. Brown, Yakup Koç, Robert E. Kooij

Telecommun. Syst., 2014

Nonexistence of optimal graphs for all terminal reliability.

Jason I. Brown, Danielle Cox

Networks, 2014

On the Roots of Domination Polynomials.

Jason I. Brown, Julia Tufts

Graphs Comb., 2014

Graphs with a Minimal Number of Convex Sets.

Jason I. Brown, Ortrud R. Oellermann

Graphs Comb., 2014

Independence densities of hypergraphs.

Anthony Bonato, Jason I. Brown, Dieter Mitsche, Pawel Pralat

Eur. J. Comb., 2014

A note on the real part of complex chromatic roots.

Jason I. Brown, Aysel Erey

Discret. Math., 2014

The average reliability of a graph.

Jason I. Brown, Danielle Cox, Richard Ehrenborg

Discret. Appl. Math., 2014

2013

On the Roots of Expected Independence Polynomials.

Jason I. Brown, Karl Dilcher, Dante V. Manna

J. Graph Theory, 2013

2012

Line Graphs and Circulants.

Jason I. Brown, Richard Hoshino

Ars Comb., 2012

On Circulants Uniquely Characterized by their Independence Polynomials.

Jason I. Brown, Richard Hoshino

Ars Comb., 2012

2011

Well-covered circulant graphs.

Jason I. Brown, Richard Hoshino

Discret. Math., 2011

Reliability polynomials crossing more than twice.

Jason I. Brown, Yakup Koc, Robert E. Kooij

Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011

2010

Proof of a conjecture on fractional Ramsey numbers.

Jason I. Brown, Richard Hoshino

J. Graph Theory, 2010

2009

On the roots of strongly connected reliability polynomials.

Jason I. Brown, Karl Dilcher

Networks, 2009

Monomial bases for broken circuit complexes.

Jason I. Brown, Bruce E. Sagan

Eur. J. Comb., 2009

Independence polynomials of circulants with an application to music.

Jason I. Brown, Richard Hoshino

Discret. Math., 2009

Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers.

Jason I. Brown, R. Hoshino

Discret. Math., 2009

The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane.

Jason I. Brown, Danielle Cox

Discret. Math., 2009

Chip firing and all-terminal network reliability bounds.

Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski

Discret. Optim., 2009

2008

The neighbourhood polynomial of a graph.

Jason I. Brown, Richard J. Nowakowski

Australas. J Comb., 2008

2007

Uniformly optimal digraphs for strongly connected reliability.

Jason I. Brown, Xiaohu Li

Networks, 2007

The structure of well-covered graphs with no cycles of length 4.

Jason I. Brown, Richard J. Nowakowski, Igor E. Zverovich

Discret. Math., 2007

The well-covered dimension of random graphs.

Jason I. Brown, Richard J. Nowakowski

Discret. Math., 2007

The Ehrenfeucht-Fraisse Game for Paths and Cycles.

Jason I. Brown, Richard Hoshino

Ars Comb., 2007

2005

Well-Covered Vector Spaces of Graphs.

Jason I. Brown, Richard J. Nowakowski

SIAM J. Discret. Math., 2005

The strongly connected reliability of complete digraphs.

Jason I. Brown, Xiaohu Li

Networks, 2005

Average independence polynomials.

Jason I. Brown, Richard J. Nowakowski

J. Comb. Theory, Ser. B, 2005

2004

The <i>k</i>-fractal of a simplicial complex.

Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski

Discret. Math., 2004

2003

The independence fractal of a graph.

Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski

J. Comb. Theory, Ser. B, 2003

2002

On chromatic roots of large subdivisions of graphs.

Jason I. Brown, Carl A. Hickman

Discret. Math., 2002

On chromatic roots with negative real part.

Jason I. Brown, Carl A. Hickman

Ars Comb., 2002

2001

On the Chromatic Roots of Generalized Theta Graphs.

Jason I. Brown, Carl A. Hickman, Alan D. Sokal, David G. Wagner

J. Comb. Theory, Ser. B, 2001

Bounding the Roots of Independence Polynomials.

Jason I. Brown, Richard J. Nowakowski

Ars Comb., 2001

1999

Subdivisions and Chromatic Roots.

Jason I. Brown

J. Comb. Theory, Ser. B, 1999

1998

On the Roots of Chromatic Polynomials.

Jason I. Brown

J. Comb. Theory, Ser. B, 1998

Chromatic polynomials and order ideals of monomials.

Jason I. Brown

Discret. Math., 1998

The existence of uniquely -G colourable graphs.

Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael Molloy

Discret. Math., 1998

1996

The Ultimate Categorical Independence Ratio of a Graph.

Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall

SIAM J. Discret. Math., 1996

Cohen-Macaulay Rings in Network Reliability.

Jason I. Brown, Charles J. Colbourn, David G. Wagner

SIAM J. Discret. Math., 1996

The number of complements of a topology on n points is at least 2ⁿ (except for some special cases).

Jason I. Brown, Stephen Watson

Discret. Math., 1996

The Complexity of Generalized Graph Colorings.

Jason I. Brown

Discret. Appl. Math., 1996

1993

Network transformations and bounding network reliability.

Jason I. Brown, Charles J. Colbourn, John S. Devitt

Networks, 1993

Mutually complementary partial orders.

Jason I. Brown, Stephen Watson

Discret. Math., 1993

1992

Roots of the Reliability Polynomial.

Jason I. Brown, Charles J. Colbourn

SIAM J. Discret. Math., 1992

A vertex critical graph without critical edges.

Jason I. Brown

Discret. Math., 1992

1991

A ramsey type problem concerning vertex colourings.

Jason I. Brown, Vojtech Rödl

J. Comb. Theory, Ser. B, 1991

Graph properties and hypergraph colourings.

Jason I. Brown, Derek G. Corneil

Discret. Math., 1991

1990

A note on <i>K_i</i>-perfect graphs.

Jason I. Brown, Derek G. Corneil, Ali Ridha Mahjoub

J. Graph Theory, 1990

Graph coloring satisfying restraints.

Jason I. Brown, David Kelly, Johanan Schönheim, Robert E. Woodrow

Discret. Math., 1990

1988

A Set System Polynomial with Colouring and Reliability Applications.

Jason I. Brown, Charles J. Colbourn

SIAM J. Discret. Math., 1988

1987

On generalized graph colorings.

Jason I. Brown, Derek G. Corneil

J. Graph Theory, 1987