2016/08/01 by Johan Kok, Kok, Johan, N. K. Sudev +7
Mathematics · #05C07 #05C38 #05C75 #05C85 #FOS: Mathematics #General Mathematics (math.GM) #math.GM #msc:05C07 #msc:05C38 #msc:05C75 #msc:05C85
paper · pdf · doi:10.48550/arxiv.1608.00856
11 Pages, 2 Figures, Southeast Asian Bulletin of Mathematics, 2016
arxiv created 2016/08/01 · arxiv updated 2016/08/03
The concepts of linear Jaco graphs and Jaco-type graphs have been introduced as certain types of directed graphs with specifically defined adjacency conditions. The distinct difference between a pure Jaco graph and a Jaco-type graph is that for a pure Jaco graph, the total vertex degree d(v) is well-defined, while for a Jaco-type graph the vertex out-degree d+(v) is well-defined. Hence, in the case of pure Jaco graphs a challenge is to determine d-(v) and d+(v) respectively and for Jaco-type graphs a challenge is to determine d-(v). In this paper, the vertex in-degrees for Fibonaccian and modular Jaco-type graphs are determined.