Jason I. Brown

Theodore Kolokolnikov

Robert E. Kooij

Networks, 2024

2023

On the split reliability of graphs.

[BibT_eX]

[DOI]

Isaac McMullin

Networks, September, 2023

Modulation Graphs in Popular Music.

[BibT_eX]

[DOI]

Ian George

CoRR, 2023

2022

On the Unimodality of Domination Polynomials.

[BibT_eX]

[DOI]

Graphs Comb., 2022

Maximal intervals of decrease and inflection points for node reliability.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

2021

Roots of two-terminal reliability polynomials.

[BibT_eX]

[DOI]

Corey D. C. DeGagné

Networks, 2021

Network reliability: Heading out on the highway.

[BibT_eX]

[DOI]

Networks, 2021

The average order of dominating sets of a graph.

[BibT_eX]

[DOI]

Discret. Math., 2021

On the real roots of domination polynomials.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2021

2020

Rational roots of all-terminal reliability.

[BibT_eX]

[DOI]

Corey D. C. DeGagné

Networks, 2020

On the imaginary parts of chromatic roots.

[BibT_eX]

[DOI]

David G. Wagner

J. Graph Theory, 2020

Maximum Modulus of Independence Roots of Graphs and Trees.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Optimal Domination Polynomials.

[BibT_eX]

[DOI]

Graphs Comb., 2020

On the roots of the subtree polynomial.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

A note on purely imaginary independence roots.

[BibT_eX]

[DOI]

Discret. Math., 2020

2019

On the reliability roots of simplicial complexes and matroids.

[BibT_eX]

[DOI]

Corey D. C. DeGagné

Discret. Math., 2019

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

[BibT_eX]

[DOI]

Mark E. Glickman

Ryan B. Song

CoRR, 2019

Independence equivalence classes of paths and cycles.

[BibT_eX]

[DOI]

Australas. J Comb., 2019

The domination equivalence classes of paths.

[BibT_eX]

[DOI]

Australas. J Comb., 2019

2018

Optimal Graphs for Independence and k-Independence Polynomials.

[BibT_eX]

[DOI]

Graphs Comb., 2018

On the roots of Wiener polynomials of graphs.

[BibT_eX]

[DOI]

Ortrud R. Oellermann

Discret. Math., 2018

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

[BibT_eX]

[DOI]

Discret. Math., 2018

The shape of node reliability.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

On the Stability of Independence Polynomials.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2017

On the roots of all-terminal reliability polynomials.

[BibT_eX]

[DOI]

Discret. Math., 2017

Restraints permitting the largest number of colourings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

On the roots of the node reliability polynomial.

[BibT_eX]

[DOI]

Networks, 2016

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

[BibT_eX]

[DOI]

Networks, 2016

On the Roots of σ-Polynomials.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

On the Real Roots of σ -Polynomials.

[BibT_eX]

[DOI]

Graphs Comb., 2016

2015

On the spectrum and number of convex sets in graphs.

[BibT_eX]

[DOI]

Ortrud R. Oellermann

Discret. Math., 2015

New bounds for chromatic polynomials and chromatic roots.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

Inflection points for network reliability.

[BibT_eX]

[DOI]

Yakup Koç

Robert E. Kooij

Telecommun. Syst., 2014

Nonexistence of optimal graphs for all terminal reliability.

[BibT_eX]

[DOI]

Networks, 2014

On the Roots of Domination Polynomials.

[BibT_eX]

[DOI]

Julia Tufts

Graphs Comb., 2014

Graphs with a Minimal Number of Convex Sets.

[BibT_eX]

[DOI]

Ortrud R. Oellermann

Graphs Comb., 2014

Independence densities of hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

A note on the real part of complex chromatic roots.

[BibT_eX]

[DOI]

Discret. Math., 2014

The average reliability of a graph.

[BibT_eX]

[DOI]

Richard Ehrenborg

Discret. Appl. Math., 2014

2013

On the Roots of Expected Independence Polynomials.

[BibT_eX]

[DOI]

Karl Dilcher

Dante V. Manna

J. Graph Theory, 2013

2012

Line Graphs and Circulants.

[BibT_eX]

Ars Comb., 2012

On Circulants Uniquely Characterized by their Independence Polynomials.

[BibT_eX]

Ars Comb., 2012

2011

Well-covered circulant graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

Reliability polynomials crossing more than twice.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

2009

On the roots of strongly connected reliability polynomials.

[BibT_eX]

[DOI]

Karl Dilcher

Networks, 2009

Monomial bases for broken circuit complexes.

[BibT_eX]

[DOI]

Bruce E. Sagan

Eur. J. Comb., 2009

Independence polynomials of circulants with an application to music.

[BibT_eX]

[DOI]

Discret. Math., 2009

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

[BibT_eX]

[DOI]

R. Hoshino

Discret. Math., 2009

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

[BibT_eX]

[DOI]

Discret. Math., 2009

Chip firing and all-terminal network reliability bounds.

[BibT_eX]

[DOI]

Discret. Optim., 2009

2008

The neighbourhood polynomial of a graph.

[BibT_eX]

[DOI]

Australas. J Comb., 2008

2007

Uniformly optimal digraphs for strongly connected reliability.

[BibT_eX]

[DOI]

Xiaohu Li

Networks, 2007

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

[BibT_eX]

[DOI]

Igor E. Zverovich

Discret. Math., 2007

The well-covered dimension of random graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

The Ehrenfeucht-Fraisse Game for Paths and Cycles.

[BibT_eX]

Ars Comb., 2007

2005

Well-Covered Vector Spaces of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

The strongly connected reliability of complete digraphs.

[BibT_eX]

[DOI]

Xiaohu Li

Networks, 2005

Average independence polynomials.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

2004

The k-fractal of a simplicial complex.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

The independence fractal of a graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

2002

On chromatic roots of large subdivisions of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

On chromatic roots with negative real part.

[BibT_eX]

Ars Comb., 2002

2001

On the Chromatic Roots of Generalized Theta Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Bounding the Roots of Independence Polynomials.

[BibT_eX]

Ars Comb., 2001

1999

Subdivisions and Chromatic Roots.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

1998

On the Roots of Chromatic Polynomials.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

Chromatic polynomials and order ideals of monomials.

[BibT_eX]

[DOI]

Discret. Math., 1998

The existence of uniquely -G colourable graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

1996

The Ultimate Categorical Independence Ratio of a Graph.

[BibT_eX]

[DOI]

Douglas F. Rall

SIAM J. Discret. Math., 1996

Cohen-Macaulay Rings in Network Reliability.

[BibT_eX]

[DOI]

David G. Wagner

SIAM J. Discret. Math., 1996

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

[BibT_eX]

[DOI]

Stephen Watson

Discret. Math., 1996

The Complexity of Generalized Graph Colorings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

1993

Network transformations and bounding network reliability.

[BibT_eX]

[DOI]

John S. Devitt

Networks, 1993

Mutually complementary partial orders.

[BibT_eX]

[DOI]

Stephen Watson

Discret. Math., 1993

1992

Roots of the Reliability Polynomial.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

A vertex critical graph without critical edges.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

A ramsey type problem concerning vertex colourings.

[BibT_eX]

[DOI]

Vojtech Rödl

J. Comb. Theory B, 1991

Graph properties and hypergraph colourings.

[BibT_eX]

[DOI]

Derek G. Corneil

Discret. Math., 1991

1990

A note on Ki-perfect graphs.

[BibT_eX]

[DOI]

Derek G. Corneil

Ali Ridha Mahjoub

J. Graph Theory, 1990

Graph coloring satisfying restraints.

[BibT_eX]

[DOI]

Discret. Math., 1990

1988

A Set System Polynomial with Colouring and Reliability Applications.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

1987

On generalized graph colorings.

[BibT_eX]

[DOI]