A note on the number of edges of the Jaco Graph, $Jn(1), n ∈ N
Abstract
Kok et.al. [3] introduced Jaco Graphs (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 Jn(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 Jn(1), n ∈ N remains an interesting open problem. In this note we present three alternative, formula.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.