pith. sign in

arxiv: 1409.0656 · v1 · pith:DRIEAHI2new · submitted 2014-09-02 · 🧮 math.CO

A note on the number of edges of the Jaco Graph, J_n(1), n in Bbb N

classification 🧮 math.CO
keywords jacoedgesformulagraphnumberclosedemphnote
0
0 comments X
read the original 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}.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.