paper

Characteristics of Jaco Graphs,

arXiv:1404.1714

Abstract

We introduce the concept of a family of finite directed graphs (order a) which are directed graphs derived from an infinite directed graph (order a), called the a-root digraph. The a-root digraph has four fundamental properties which are; and, if is the head of an edge (arc) then the tail is always a vertex and, if for smallest is a tail vertex then all vertices are tails of arcs to and finally, the degree of vertex is The family of finite directed graphs are those limited to vertices by lobbing off all vertices (and edges arcing to vertices) Hence, trivially we have for We present an interesting Lucassian-Zeckendorf result and other general results of interest. It is meant to be an introductory paper to encourage exploratory research.

13 pages. arXiv admin note: text overlap with arXiv:1404.0484