English

Characteristics of Jaco Graphs, $J_\infty(a), a \in \Bbb N$

Combinatorics 2014-04-08 v1

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; V(J(a))={viiN}V(J_\infty(a)) = \{v_i|i \in \Bbb N\} and, if vjv_j is the head of an edge (arc) then the tail is always a vertex vi,i<jv_i, i<j and, ifvkv_k for smallest kNk \in \Bbb N is a tail vertex then all vertices v,k<<jv_\ell, k< \ell < j are tails of arcs to vjv_j and finally, the degree of vertex kk is d(vk)=ak.d(v_k) = ak. The family of finite directed graphs are those limited to nNn \in \Bbb N vertices by lobbing off all vertices (and edges arcing to vertices)vt,t>n.v_t, t> n. Hence, trivially we have d(vi)aid(v_i) \leq ai for iN.i \in \Bbb N. 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.

Keywords

Cite

@article{arxiv.1404.1714,
  title  = {Characteristics of Jaco Graphs, $J_\infty(a), a \in \Bbb N$},
  author = {Johan Kok and Paul Fisher and Bettina Wilkens and Mokhwetha Mabula and Vivian Mukungunugwa},
  journal= {arXiv preprint arXiv:1404.1714},
  year   = {2014}
}

Comments

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