8 citations · 13 across the 10 of their papers we have counts for
6 papers · 2 filters
Avoidance bases for formulas with reversal
James Currie, Lucas Mol, Narad Rampersad
In the interest of studying formulas with reversal of high avoidability index, we find -avoidance bases for formulas with reversal for . We demonstrate that there…
On the Mean Connected Induced Subgraph Order of Cographs
Matthew E. Kroeker, Lucas Mol, Ortrud R. Oellermann
In this article the extremal structures for the mean order of connected induced subgraphs of cographs are determined. It is shown that among all connected cographs of order $n \ge…
Maximizing the mean subtree order
Lucas Mol, Ortrud R. Oellermann
This article focuses on properties and structures of trees with maximum mean subtree order in a given family; such trees are called optimal in the family. Our main goal is to descr…
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…
On avoidability of formulas with reversal
James Daniel Currie, Lucas Mol, Narad Rampersad
While a characterization of unavoidable formulas (without reversal) is well-known, little is known about the avoidability of formulas with reversal in general. In this article, we…