A Study on Linear Jaco Graphs

Abstract: We introduce the concept of a family of finite directed graphs (emph{positive integer order,}

f (x) = m x + c; x, m i n B b b N

and

c i n B b b N_{0})

which are directed graphs derived from an infinite directed graph called the

f (x)

-root digraph. The

f (x)

-root digraph has four fundamental properties which are;

V (J_{i} n f t y (f (x))) = v_{i} : i i n B b b N

and, if

v_{j}

is the head of an arc then the tail is always a vertex

v_{i}, i < j

and, if

v_{k}

for smallest

k i n B b b N

is a tail vertex then all vertices

v_{e} l l, k < e l l < j

are tails of arcs to

v_{j}

and finally, the degree of a vertex

v_{k}

is

d (v_{k}) = m k + c

. The family of finite directed graphs are those limited to

n i n B b b N

vertices by lobbing off all vertices (and corresponding arcs)

v_{t}, t > n .

Hence, trivially we have

d (v_{i}) l e q m i + c

for

i i n B b b N .

It is meant to be an emph{introductory paper} to encourage further research.

This page was built for publication: A Study on Linear Jaco Graphs