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

2014/09/02 by Johan Kok, Kok, Johan, Vivian Mukungunugwa +1
Computer Science · Mathematics · #Algorithms and Data Compression #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO

paper · pdf · doi:10.48550/arxiv.1409.0656

6 pages

arxiv created 2014/09/02 · openalex publication_date 2014/09/02 · arxiv updated 2014/09/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 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 ∈ \Bbb N remains an interesting open problem. In this note we present three alternative, formula.

Related

• A note on the Brush Number of Jaco Graphs, J_n(1), n ∈ \Bbb N
• Contemplating some invariants of the Jaco Graph, J_n(1), n ∈ \Bbb N
• Characteristics of Finite Jaco Graphs, J_n(1), n ∈ \Bbb N
• A Note on the Gutman Index of Jaco Graphs
• Integer sequences with conjectured relation with certain graph parameters of the family of linear Jaco graphs