Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/10472
Title: | Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and alternate Lucas cubes | Authors: | Eǧeci˙oǧlu,Ö. Saygi,E. Saygi,Z. |
Keywords: | alternate Lucas cube diametral path Euler number Fibonacci cube Lucas cube Shortest path |
Publisher: | World Scientific | Abstract: | The diameter of a graph is the maximum distance between pairs of vertices in the graph. A pair of vertices whose distance is equal to its diameter is called diametrically opposite vertices. The collection of shortest paths between diametrically opposite vertices is referred as diametral paths. In this work, we enumerate the number of diametral paths for Fibonacci cubes, Lucas cubes and alternate Lucas cubes. We present bijective proofs that show that these numbers are related to alternating permutations and are enumerated by Euler numbers. © 2024 World Scientific Publishing Company. | URI: | https://doi.org/10.1142/S1793830923500271 https://hdl.handle.net/20.500.11851/10472 |
ISSN: | 1793-8309 |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection |
Show full item record
CORE Recommender
WEB OF SCIENCETM
Citations
1
checked on Nov 9, 2024
Page view(s)
34
checked on Nov 4, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.