On d-Fibonacci digraphs

On d-Fibonacci digraphs

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 −...

Full description

Saved in:
Bibliographic Details
Main Authors: Dalfó, C.; Departament de Matemàtica, Universitat de Lleida, Igualada (Barcelona) (Author), Fiol, M.A.; Departament de Matematiques, Universitat Polit'ecnica de Catalunya Barcelona Graduate School of Mathematics Institut de Matematiques de la UPC-BarcelonaTech (IMTech) (Author)
Other Authors: AGAUR from the Catalan Government under project 2017SGR1087 (Contributor), MICINN from the Spanish Government under project P 5471-B-I00 (Contributor), MICINN from the Spanish Government under project M 3271-R (Contributor)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2021-10-16.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items