Abstract
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 is well-defined, while for a Jaco-type graph the vertex out-degree is well-defined. Hence, in the case of pure Jaco graphs a challenge is to determine and respectively and for Jaco-type graphs a challenge is to determine . In this paper, the vertex in-degrees for Fibonaccian and modular Jaco-type graphs are determined.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.