2000 character limit reached
A note on the number of edges of the Jaco Graph, $J_n(1), n \in \Bbb N
Published 2 Sep 2014 in math.CO | (1409.0656v1)
Abstract: Kok et.al. [3] introduced Jaco Graphs \emph{(order 1)}. It is hoped that as a special case, a closed formula can be found for the number of edges of a finite Jaco Graph $J_n(1)$. However, the algorithms discussed in Ahlbach et.al. [1] suggest this might not be possible. Finding a closed formula for the number of edges of a Jaco Graph $J_n(1), n \in \Bbb N$ remains an interesting open problem. In this note we present three alternative, \emph{formula}.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.