Jason I. Brown

According to our database1, Jason I. Brown authored at least 72 papers between 1987 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Rational roots of all-terminal reliability.
Networks, 2020

On the imaginary parts of chromatic roots.
J. Graph Theory, 2020

Maximum Modulus of Independence Roots of Graphs and Trees.
Graphs Comb., 2020

Optimal Domination Polynomials.
Graphs Comb., 2020

On the roots of the subtree polynomial.
Eur. J. Comb., 2020

A note on purely imaginary independence roots.
Discret. Math., 2020

2019
On the reliability roots of simplicial complexes and matroids.
Discret. Math., 2019

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

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

On the roots of Wiener polynomials of graphs.
Discret. Math., 2018

On the unimodality of independence polynomials of very well-covered graphs.
Discret. Math., 2018

The shape of node reliability.
Discret. Appl. Math., 2018

On the Stability of Independence Polynomials.
Electron. J. Comb., 2018

2017
On the roots of all-terminal reliability polynomials.
Discret. Math., 2017

Restraints permitting the largest number of colourings.
Discret. Appl. Math., 2017

2016
On the roots of the node reliability polynomial.
Networks, 2016

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

On the Roots of σ-Polynomials.
J. Graph Theory, 2016

On the Real Roots of σ -Polynomials.
Graphs Comb., 2016

2015
On the spectrum and number of convex sets in graphs.
Discret. Math., 2015

New bounds for chromatic polynomials and chromatic roots.
Discret. Math., 2015

2014
Inflection points for network reliability.
Telecommun. Syst., 2014

Nonexistence of optimal graphs for all terminal reliability.
Networks, 2014

On the Roots of Domination Polynomials.
Graphs Comb., 2014

Graphs with a Minimal Number of Convex Sets.
Graphs Comb., 2014

Independence densities of hypergraphs.
Eur. J. Comb., 2014

A note on the real part of complex chromatic roots.
Discret. Math., 2014

The average reliability of a graph.
Discret. Appl. Math., 2014

2013
On the Roots of Expected Independence Polynomials.
J. Graph Theory, 2013

2012
Line Graphs and Circulants.
Ars Comb., 2012

On Circulants Uniquely Characterized by their Independence Polynomials.
Ars Comb., 2012

2011
Well-covered circulant graphs.
Discret. Math., 2011

Reliability polynomials crossing more than twice.
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.
J. Graph Theory, 2010

2009
On the roots of strongly connected reliability polynomials.
Networks, 2009

Monomial bases for broken circuit complexes.
Eur. J. Comb., 2009

Independence polynomials of circulants with an application to music.
Discret. Math., 2009

Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers.
Discret. Math., 2009

The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane.
Discret. Math., 2009

Chip firing and all-terminal network reliability bounds.
Discret. Optim., 2009

2008
The neighbourhood polynomial of a graph.
Australas. J Comb., 2008

2007
Uniformly optimal digraphs for strongly connected reliability.
Networks, 2007

The structure of well-covered graphs with no cycles of length 4.
Discret. Math., 2007

The well-covered dimension of random graphs.
Discret. Math., 2007

The Ehrenfeucht-Fraisse Game for Paths and Cycles.
Ars Comb., 2007

2005
Well-Covered Vector Spaces of Graphs.
SIAM J. Discret. Math., 2005

The strongly connected reliability of complete digraphs.
Networks, 2005

Average independence polynomials.
J. Comb. Theory, Ser. B, 2005

2004
The <i>k</i>-fractal of a simplicial complex.
Discret. Math., 2004

2003
The independence fractal of a graph.
J. Comb. Theory, Ser. B, 2003

2002
On chromatic roots of large subdivisions of graphs.
Discret. Math., 2002

On chromatic roots with negative real part.
Ars Comb., 2002

2001
On the Chromatic Roots of Generalized Theta Graphs.
J. Comb. Theory, Ser. B, 2001

Bounding the Roots of Independence Polynomials.
Ars Comb., 2001

1999
Subdivisions and Chromatic Roots.
J. Comb. Theory, Ser. B, 1999

1998
On the Roots of Chromatic Polynomials.
J. Comb. Theory, Ser. B, 1998

Chromatic polynomials and order ideals of monomials.
Discret. Math., 1998

The existence of uniquely -G colourable graphs.
Discret. Math., 1998

1996
The Ultimate Categorical Independence Ratio of a Graph.
SIAM J. Discret. Math., 1996

Cohen-Macaulay Rings in Network Reliability.
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

The Complexity of Generalized Graph Colorings.
Discret. Appl. Math., 1996

1993
Network transformations and bounding network reliability.
Networks, 1993

Mutually complementary partial orders.
Discret. Math., 1993

1992
Roots of the Reliability Polynomial.
SIAM J. Discret. Math., 1992

A vertex critical graph without critical edges.
Discret. Math., 1992

1991
A ramsey type problem concerning vertex colourings.
J. Comb. Theory, Ser. B, 1991

Graph properties and hypergraph colourings.
Discret. Math., 1991

1990
A note on <i>K<sub>i</sub></i>-perfect graphs.
J. Graph Theory, 1990

Graph coloring satisfying restraints.
Discret. Math., 1990

1988
A Set System Polynomial with Colouring and Reliability Applications.
SIAM J. Discret. Math., 1988

1987
On generalized graph colorings.
J. Graph Theory, 1987


  Loading...