2021
DOI: 10.5614/ejgta.2021.9.2.22
|View full text |Cite
|
Sign up to set email alerts
|

On d-Fibonacci digraphs

Abstract: The d-Fibonacci digraphs F (d, k), introduced here, have the number of vertices following some generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their nice properties. For instance, F (d, k) has diameter d + k − 2 and is semi-pancyclic; that is, it has a cycle of every length between 1 and , with ∈ {2k − 2, 2k − 1}. Moreover, it turns out that several other numbers of F (d, k) (of closed l-walks, classes of vertices, etc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 7 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?