8 citations · 11 across the 6 of their papers we have counts for
5 papers · 1 filter
On the Mean Order of Connected Induced Subgraphs of Block Graphs
Kristaps J. Balodis, Matthew E. Kroeker, Lucas Mol +1
The average order of the connected induced subgraphs of a graph is called the mean connected induced subgraph (CIS) order of . This is an extension of the mean subtree order…
On the roots of the subtree polynomial
Jason I. Brown, Lucas Mol
For a tree , the subtree polynomial of is the generating polynomial for the number of subtrees of . We show that the complex roots of the subtree polynomial are contained…
Cobham's Theorem and Automaticity
Lucas Mol, Narad Rampersad, Jeffrey Shallit +1
We make certain bounds in Krebs' proof of Cobham's theorem explicit and obtain corresponding upper bounds on the length of a common prefix of an aperiodic -automatic sequence an…
Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture
James D. Currie, Lucas Mol, Narad Rampersad
A word is called -free if it has no factors of exponent greater than or equal to . The repetition threshold is the infimum of the set of all such that th…
On the roots of Wiener polynomials of graphs
Jason I. Brown, Ortrud Oellermann, Lucas Mol
The Wiener polynomial of a connected graph is defined as , where denotes the distance between and , and the sum is taken over all unorde…