7 citations · 9 across the 3 of their papers we have counts for
3 papers
math.CO2022
Counting closed walks in infinite regular trees using Catalan and Borel's triangles
Lord C. Kavi, Michael W. Newman
We count the number of closed walks on a vertex in a regular tree using the Catalan's triangle and also the Borel's triangle, showing another combinatorial structure counted by the…
math.CO2022★ 7 cited
The optimal bound on the 3-independence number obtainable from a polynomial-type method
Lord C. Kavi, Mike Newman
A -independent set in a connected graph is a set of vertices such that any two vertices in the set are at distance greater than in the graph. The -independence number of…
math.CO2016★ 2 cited
A study of the Structural Properties of finite -graphs and their Characterisation
Lord Clifford Kavi
The -graph is a graph from the group generated by , where the vertices are the right cosets of the cyclic subgroups with $…