Enumeration of Paths in the Young–Fibonacci Graph

被引：0
|
作者：
Evtushevsky V.Y. [1 ]
机构：
[1] St.Petersburg State University, St.Petersburg
来源：
Journal of Mathematical Sciences | 2020年 / 247卷 / 5期
关键词：
D O I：
10.1007/s10958-020-04829-7
中图分类号：
学科分类号：
摘要：
The Young–Fibonacci graph is the Hasse diagram of one of the two (along with the Young lattice) 1-differential graded modular lattices. This explains the interest to path enumeration problems in this graph. We obtain a formula for the number of paths between two vertices of the Young–Fibonacci graph which is polynomial with respect to the minimum of their ranks. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.
引用
收藏
页码：663 / 679
页数：16
相关论文
共 50 条
  • [41] Distance Fibonacci Polynomials by Graph Methods
    Strzalka, Dominik
    Wolski, Slawomir
    Wloch, Andrzej
    SYMMETRY-BASEL, 2021, 13 (11):
  • [42] FIBONACCI AND LUCAS NUMBERS AND COMPLEXITY OF A GRAPH
    SHANNON, AG
    FIBONACCI QUARTERLY, 1978, 16 (01): : 1 - 4
  • [43] EXACT ENUMERATION OF MINIMAL PATHS OF PARTITIONED NETWORKS
    NAHMAN, JM
    MICROELECTRONICS RELIABILITY, 1994, 34 (07) : 1167 - 1176
  • [44] Enumeration of (r + 2)-paths in a Boolean Cube
    Litiff, S.
    Proceedings of the ISMM International Symposium Computer Applications in Design, Simulation and Analysis, 1991,
  • [45] Hypergeometric τ-Functions, Hurwitz Numbers and Enumeration of Paths
    Harnad, J.
    Orlov, A. Yu.
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2015, 338 (01) : 267 - 284
  • [46] General results on the enumeration of strings in Dyck paths
    Manes, K.
    Sapounakis, A.
    Tasoulas, I.
    Tsikouras, P.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [47] Enumeration of Lukasiewicz paths modulo some patterns
    Baril, Jean-Luc
    Kirgizov, Sergey
    Petrossian, Armen
    DISCRETE MATHEMATICS, 2019, 342 (04) : 997 - 1005
  • [48] Enumeration of strings in Dyck paths: A bijective approach
    Sapounakis, A.
    Tasoulas, I.
    Tsikouras, P.
    DISCRETE MATHEMATICS, 2009, 309 (10) : 3032 - 3039
  • [49] Paths in the simple random graph and the waxman graph
    Van Mieghem, P
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2001, 15 (04) : 535 - 555
  • [50] Power network analysis with graph enumeration
    Inoue, Takeru
    Yasuda, Norihito
    Tsuda, Koji
    Journal of the Institute of Electronics, Information and Communication Engineers, 2014, 97 (12): : 1091 - 1096
12345