Ben Cameron

From MaRDI portal
Person:831868

Available identifiers

zbMath Open cameron.benMaRDI QIDQ831868

List of research outcomes





PublicationDate of PublicationType
A tight upper bound on the average order of dominating sets of a graph2024-11-24Paper
Cut-down de Bruijn sequences2024-11-09Paper
Pivot Gray codes for the spanning trees of a graph ft. the fan2024-07-29Paper
Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs2024-03-26Paper
Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs2023-12-22Paper
The node cop‐win reliability of unicyclic and bicyclic graphs2023-12-11Paper
On the mean subtree order of graphs under edge addition2023-09-29Paper
A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs2023-05-23Paper
A pivot Gray code listing for the spanning trees of the fan graph2023-03-30Paper
Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality2023-03-09Paper
A Tight Upper Bound on the Average Order of Dominating Sets of a Graph2022-08-22Paper
Cut-Down de Bruijn Sequences2022-05-05Paper
Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four2022-03-24Paper
A Hamilton cycle in the \(k\)-sided pancake network2022-03-22Paper
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan2022-02-03Paper
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph2021-08-20Paper
A Hamilton Cycle in the $k$-Sided Pancake Network2021-03-16Paper
A note on purely imaginary independence roots2020-10-08Paper
Dichotomizing $k$-vertex-critical $H$-free graphs for $H$ of order four2020-06-30Paper
On the largest real root of the independence polynomial of a unicyclic graph2020-06-09Paper
Maximum modulus of independence roots of graphs and trees2020-04-30Paper
Independence Equivalence Classes of Paths and Cycles2019-12-19Paper
On the stability of independence polynomials2018-05-25Paper
On the unimodality of independence polynomials of very well-covered graphs2018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q34514412015-11-16Paper
An approximation algorithm for zero forcingN/APaper
On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bullsN/APaper

Research outcomes over time

This page was built for person: Ben Cameron