Characteristics of Finite Jaco Graphs, Jn(1),n∈NJ_n(1), n \in \Bbb N

preprint2014arXivOpen access

Abstract

We introduce the concept of a family of finite directed graphs (order 1) which are directed graphs derived from an infinite directed graph (order 1), called the 1-root digraph. The 1-root digraph has four fundamental properties which are; V(J∞(1))={vi∣i∈N}V(J_\infty(1)) = \{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, if vkv_k, for smallest k∈Nk \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)=k.d(v_k) = k. The family of finite directed graphs are those limited to n∈Nn \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)≤id(v_i) \leq i for i∈Ni \in \Bbb N. We present an interesting Fibonaccian-Zeckendorf result and present the Fisher Algorithm to table particular values of interest. It is meant to be an introductory paper to encourage exploratory research.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.