GRAPH-THEORETIC MODELS FOR THE UNIVARIATE FIBONACCI FAMILY

被引:0
|
作者
Koshy, Thomas [1 ]
机构
[1] Framingham State Univ, Dept Math, Framingham, MA 01701 USA
来源
FIBONACCI QUARTERLY | 2015年 / 53卷 / 02期
关键词
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We construct graph-theoretic models for an extended univariate Fi-bonacci family, which includes Fibonacci, Lucas, Pell, and Pell-Lucas polynomials.
引用
收藏
页码:135 / 146
页数:12
相关论文
共 50 条
  • [41] Graph-Theoretic Problems and Their New Applications
    Werner, Frank
    MATHEMATICS, 2020, 8 (03)
  • [42] Multiperspective Graph-Theoretic Similarity Measure
    Le, Dung D.
    Lauw, Hady W.
    CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2018, : 1223 - 1232
  • [43] A Graph-Theoretic Model of Routing Hierarchies
    Lai, Yvonne
    Lai, Wai Sum
    2009 INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS WORKSHOPS: WAINA, VOLS 1 AND 2, 2009, : 1118 - +
  • [44] Graph-Theoretic Approach to Quantum Correlations
    Cabello, Adan
    Severini, Simone
    Winter, Andreas
    PHYSICAL REVIEW LETTERS, 2014, 112 (04)
  • [45] A graph-theoretic analysis of information value
    Poh, KL
    Horvitz, E
    UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 1996, : 427 - 435
  • [46] Graph-theoretic techniques for macromolecular docking
    Gardiner, EJ
    Willett, P
    Artymiuk, PJ
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 2000, 40 (02): : 273 - 279
  • [47] GRAPH-THEORETIC CHARACTERIZATION OF CLASSICAL GEOMETRIES
    SHULT, EE
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (01): : A8 - A8
  • [48] A graph-theoretic approach for inparalog detection
    Olivier Tremblay-Savard
    Krister M Swenson
    BMC Bioinformatics, 13
  • [49] A GRAPH-THEORETIC APPROACH TO DEFAULT LOGIC
    DIMOPOULOS, Y
    MAGIROU, V
    INFORMATION AND COMPUTATION, 1994, 112 (02) : 239 - 256
  • [50] A GRAPH-THEORETIC APPROACH TO THE EVOLUTION OF CAHOKIA
    PEREGRINE, P
    AMERICAN ANTIQUITY, 1991, 56 (01) : 66 - 75