39 citations · 123 across the 33 of their papers we have counts for
6 papers · 1 filter
A note on the real part of complex chromatic roots
Jason Brown, Aysel Erey
A {\em chromatic root} is a root of the chromatic polynomial of a graph. While the real chromatic roots have been extensively studied and well understood, little is known about the…
New Bounds for Chromatic Polynomials and Chromatic Roots
Jason Brown, Aysel Erey
If is a -chromatic graph of order then it is known that the chromatic polynomial of , , is at most …
Restraints Permitting the Largest Number of Colourings
Jason Brown, Aysel Erey
A \textit{restraint} on is a function which assigns each vertex of a finite set of forbidden colours . A proper colouring of is said to be \textit{per…
On the real roots of -Polynomials
Jason Brown, Aysel Erey
The -polynomial is given by , where is the number of partitions of the vertices of into nonempty independent sets…
Extremal Restraints for Graph Colourings
Jason I. Brown, Aysel Erey, Jian Li
A {\em restraint} on a (finite undirected) graph is a function on such that is a finite subset of ; a proper vertex colouring of is…
On the roots of the node reliability polynomial
Jason Brown, Lucas Mol
Given a graph whose edges are perfectly reliable and whose nodes each operate independently with probability the node reliability of is the probability that at…