# On the Vertex In-Degrees of Certain Jaco-Type Graphs

Source: [On the Vertex In-Degrees of Certain Jaco-Type Graphs](<https://www.sota2.com/research/paper/68fa52ff1e209131ce97f683>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T12:12:03.494Z

Authors: Johan Kok, N. K. Sudev, K. P. Chithra, K. A. Germina, U. Mary

Published: 2016-08-01T15:50:02.000Z

## 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 $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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1608.00856>)

[PDF](<https://arxiv.org/pdf/1608.00856.pdf>)