39 citations · 123 across the 33 of their papers we have counts for
6 papers · 1 filter
The Domination Equivalence Classes of Paths
Iain Beaton, Jason I. Brown
A dominating set of a graph of order is a subset of the vertices of such that every vertex is either in or adjacent to a vertex of . %The domination number $…
Optimal Graphs for Independence and -Independence Polynomials
J. I. Brown, D. Cox
The independence polynomial of a finite graph is the generating function for the sequence of the number of independent sets of each cardinality. We investigate whether…
On the Unimodality of Independence Polynomials of Very Well-Covered Graphs
Jason I. Brown, Ben Cameron
The independence polynomial of a graph is the generating function of the numbers of independent sets of each size. A graph of order is very well-covered if every m…
On the imaginary parts of chromatic root
Jason I. Brown, David G. Wagner
While much attention has been directed to the maximum modulus and maximum real part of chromatic roots of graphs of order (that is, with vertices), relatively little is kno…
The shape of node reliability
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…
On the roots of all-terminal reliability polynomials
Jason Brown, Lucas Mol
Given a graph in which each edge fails independently with probability the all-terminal reliability of is the probability that all vertices of can communica…