B. Cameron

activity

20172022

most citedOn the Unimodality of Independence Polynomials of Very Well-Covered Graphs

2 citations · 6 across the 9 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

The node cop-win reliability of unicyclic and bicyclic graphs

Maimoonah Ahmed, Ben Cameron

Various models to quantify the reliability of a network have been studied where certain components of the graph may fail at random and the probability that the remaining graph is c…

math.CO2020★ 1 cited

Dichotomizing $k$ -vertex-critical $H$ -free graphs for $H$ of order four

Ben Cameron, Chính T. Hoàng, Joe Sawada

For $k \geq 3$ , we prove (i) there is a finite number of $k$ -vertex-critical $(P_{2} + ℓ P_{1})$ -free graphs and (ii) $k$ -vertex-critical $(P_{3} + P_{1})$ -free graphs have at most $2 k - 1$ v…

math.CO2020

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…

The node cop-win reliability of unicyclic and bicyclic graphs

Dichotomizing k-vertex-critical H-free graphs for H of order four

A note on purely imaginary independence roots

Dichotomizing $k$ -vertex-critical $H$ -free graphs for $H$ of order four