Jason I. Brown
According to our database^{1},
Jason I. Brown
authored at least 62 papers
between 1987 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at zbmath.org
On csauthors.net:
Bibliography
2018
Optimal Graphs for Independence and kIndependence Polynomials.
Graphs and Combinatorics, 2018
On the roots of Wiener polynomials of graphs.
Discrete Mathematics, 2018
On the unimodality of independence polynomials of very wellcovered graphs.
Discrete Mathematics, 2018
The shape of node reliability.
Discrete Applied Mathematics, 2018
On the Stability of Independence Polynomials.
Electr. J. Comb., 2018
2017
Restraints permitting the largest number of colourings.
Discrete Applied Mathematics, 2017
2016
Inflection points of reliability polynomials are dense in [0, 1].
Networks, 2016
On the Roots of σPolynomials.
Journal of Graph Theory, 2016
On the Real Roots of σ Polynomials.
Graphs and Combinatorics, 2016
2015
On the spectrum and number of convex sets in graphs.
Discrete Mathematics, 2015
New bounds for chromatic polynomials and chromatic roots.
Discrete Mathematics, 2015
2014
Inflection points for network reliability.
Telecommunication Systems, 2014
Nonexistence of optimal graphs for all terminal reliability.
Networks, 2014
On the Roots of Domination Polynomials.
Graphs and Combinatorics, 2014
Graphs with a Minimal Number of Convex Sets.
Graphs and Combinatorics, 2014
Independence densities of hypergraphs.
Eur. J. Comb., 2014
A note on the real part of complex chromatic roots.
Discrete Mathematics, 2014
The average reliability of a graph.
Discrete Applied Mathematics, 2014
2013
On the Roots of Expected Independence Polynomials.
Journal of Graph Theory, 2013
2012
Line Graphs and Circulants.
Ars Comb., 2012
On Circulants Uniquely Characterized by their Independence Polynomials.
Ars Comb., 2012
2011
Wellcovered circulant graphs.
Discrete Mathematics, 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.
Journal of 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.
Discrete Mathematics, 2009
NordhausGaddum inequalities for the fractional and circular chromatic numbers.
Discrete Mathematics, 2009
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane.
Discrete Mathematics, 2009
Chip firing and allterminal network reliability bounds.
Discrete Optimization, 2009
2008
The neighbourhood polynomial of a graph.
Australasian J. Combinatorics, 2008
2007
Uniformly optimal digraphs for strongly connected reliability.
Networks, 2007
The structure of wellcovered graphs with no cycles of length 4.
Discrete Mathematics, 2007
The wellcovered dimension of random graphs.
Discrete Mathematics, 2007
The EhrenfeuchtFraisse Game for Paths and Cycles.
Ars Comb., 2007
2005
WellCovered Vector Spaces of Graphs.
SIAM J. Discrete Math., 2005
The strongly connected reliability of complete digraphs.
Networks, 2005
Average independence polynomials.
J. Comb. Theory, Ser. B, 2005
2004
The kfractal of a simplicial complex.
Discrete Mathematics, 2004
2003
The independence fractal of a graph.
J. Comb. Theory, Ser. B, 2003
2002
On chromatic roots of large subdivisions of graphs.
Discrete Mathematics, 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.
Discrete Mathematics, 1998
The existence of uniquely G colourable graphs.
Discrete Mathematics, 1998
1996
The Ultimate Categorical Independence Ratio of a Graph.
SIAM J. Discrete Math., 1996
CohenMacaulay Rings in Network Reliability.
SIAM J. Discrete Math., 1996
The number of complements of a topology on n points is at least 2^{n} (except for some special cases).
Discrete Mathematics, 1996
The Complexity of Generalized Graph Colorings.
Discrete Applied Mathematics, 1996
1993
Network transformations and bounding network reliability.
Networks, 1993
Mutually complementary partial orders.
Discrete Mathematics, 1993
1992
Roots of the Reliability Polynomial.
SIAM J. Discrete Math., 1992
A vertex critical graph without critical edges.
Discrete Mathematics, 1992
1991
A ramsey type problem concerning vertex colourings.
J. Comb. Theory, Ser. B, 1991
Graph properties and hypergraph colourings.
Discrete Mathematics, 1991
1990
A note on K_{i}perfect graphs.
Journal of Graph Theory, 1990
Graph coloring satisfying restraints.
Discrete Mathematics, 1990
1988
A Set System Polynomial with Colouring and Reliability Applications.
SIAM J. Discrete Math., 1988
1987
On generalized graph colorings.
Journal of Graph Theory, 1987