### A Study on Jaco-Type Graphs

#### Abstract

*root*-graph has \(d^+(v_n)=a_n\). The infinite directed

*root*-graph is denoted \(J_\infty(\{a_n\})\). The family of finite Jaco-Type graphs is the set of directed graphs \(J_n(\{a_n\})\), \(n\in \mathbb{N}\) by lobbing off all vertices and arcs in \(J_\infty(\{a_n\})\) for vertices \(v_i\), \(i > n\). We present introductory results for two families of these new directed graphs.

#### Keywords

#### Full Text:

PDF#### References

J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Press, London (1976).

A. Brandstädt, V.B. Le and J.P. Spinrad, Graph classes: A Survey, SIAM, Philadelphia (1999).

G. Chartrand and L. Lesniak, Graphs and Digraphs, CRC Press (2000).

F. Harary, Graph Theory, Addison-Wesley Publishing Company, London (1969).

J. Kok, P. Fisher, B. Wilkens, M. Mabula and V. Mukungunugwa, Characteristics of finite Jaco graphs, (J_n(1)), (n inmathbb{N}), arXiv: 1404.0484v1 [math.CO].

J. Kok, P. Fisher, B. Wilkens, M. Mabula and V. Mukungunugwa, Characteristics of Jaco graphs, (J_infty(a)), (ainmathbb{N}), arXiv: 1404.1714v1 [math.CO], 7 April 2014.

J. Kok, C. Susanth and S.J. Kalayathankal, A study on linear Jaco graphs, J. Informatics & Math. Sci. 7 (2) (2015), 69–80.

J. Kok, Linear Jaco graphs: A critical review, J. Informatics & Math. Sci. 8 (2) (2016), 67–103.

D.B. West, Introduction to Graph Theory, Pearson Education Inc. (2001).

DOI: http://dx.doi.org/10.26713%2Fjims.v8i2.407

eISSN 0975-5748; pISSN 0974-875X