1 citations · 1 across the 2 of their papers we have counts for
4 papers
Permutation complexity of images of Sturmian words by marked morphisms
Adam Borchert, Narad Rampersad
We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is for some constant and all lengths sufficiently large.
Words with many palindrome pair factors
Adam Borchert, Narad Rampersad
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the property that for infinitely many n, every length-n factor is a product of two pali…
Global cycle properties in graphs with large minimum clustering coefficient
Adam Borchert, Skylar Nicol, Ortrud R. Oellermann
The clustering coefficient of a vertex in a graph is the proportion of neighbours of the vertex that are adjacent. The minimum clustering coefficient of a graph is the smallest clu…
Global cycle properties in locally isometric graphs
Adam Borchert, Skylar Nicol, Ortrud R. Oellermann
A graph G is locally isometric if the subgraph induced by the neighbourhood of every vertex is an isometric subgraph of G. It is shown that the hamilton cycle problem for locally i…