2 citations · 4 across the 4 of their papers we have counts for
5 papers
Dichotomizing -vertex-critical -free graphs for of order four
Ben Cameron, Chính T. Hoàng, Joe Sawada
For , we prove (i) there is a finite number of -vertex-critical -free graphs and (ii) -vertex-critical -free graphs have at most v…
A note on purely imaginary independence roots
Ben Cameron, Jason I. Brown
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each cardinality and its roots are called independence roots. We investiga…
On the Mean Subtree Order of Graphs Under Edge Addition
Ben Cameron, Lucas Mol
For a graph , the mean subtree order of is the average order of a subtree of . In this note, we provide counterexamples to a recent conjecture of Chin, Gordon, MacPhee, a…
Maximum Modulus of Independence Roots of Graphs and Trees
Jason I. Brown, Ben Cameron
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size and its roots are called independence roots. We bound the maximu…
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…