The spectral radius of the adjacency matrix of a complete binary tree as the number of nodes approaches infinity

被引：0
|
作者：
Liu, Lin [1 ]
机构：
[1] Xiamen Univ, Tan Kah Kee Coll, Zhangzhou, Peoples R China
来源：
2ND INTERNATIONAL CONFERENCE ON APPLIED MATHEMATICS, MODELLING, AND INTELLIGENT COMPUTING (CAMMIC 2022) | 2022年 / 12259卷
关键词：
binary tree; adjacency matrix; eigenvalue; LARGEST EIGENVALUE; GRAPHS; BOUNDS;
D O I：
10.1117/12.2638932
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Trees are connected graphs without cycles, which are widely used in different fields. One of the hot topics in graph theory is the eigenvalue of graph's adjacency matrix, also known as graph's adjacency spectrum, which is an important research field of graph theory and has a wide range of practical applications. In this paper, we prove that the spectral radius of the adjacency matrix of the complete binary tree is 2 root 2 when the number of nodes tends to infinity by the eigenvalue of the adjacency matrix of the complete binary tree.
引用
收藏
页数：7
相关论文
共 10 条
  • [1] On the spectral radius of the adjacency matrix and signless Laplacian matrix of a graph
    Jahanbani, A.
    Sheikholeslami, S. M.
    LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (21) : 6846 - 6851
  • [2] On the spectral radius of the generalized adjacency matrix of a digraph
    Baghipur, Maryam
    Ganie, Hilal A.
    Ghorbani, Modjtaba
    Andrade, Enide
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2022, 653 : 287 - 313
  • [3] The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges
    Hong, Zhen-Mu
    Fan, Yi-Zheng
    GRAPHS AND COMBINATORICS, 2015, 31 (05) : 1473 - 1485
  • [4] On the spectral radius and energy of the weighted adjacency matrix of a graph
    Xu, Baogen
    Li, Shuchao
    Yu, Rong
    Zhao, Qin
    APPLIED MATHEMATICS AND COMPUTATION, 2019, 340 : 156 - 163
  • [5] On spectral radius and energy of extended adjacency matrix of graphs
    Das, Kinkar Ch.
    Gutman, Ivan
    Furtula, Boris
    APPLIED MATHEMATICS AND COMPUTATION, 2017, 296 : 116 - 123
  • [6] A note on eigenvalue, spectral radius and energy of extended adjacency matrix
    Ghorbani, Modjtaba
    Amraei, Najaf
    DISCRETE APPLIED MATHEMATICS, 2022, 322 : 102 - 116
  • [7] Spectral radius of weighted adjacency matrix of trees based on Balaban index
    Gao, Baochuan
    Deng, Bo
    Xiao, Yulan
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024,
  • [8] The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges
    Zhen-Mu Hong
    Yi-Zheng Fan
    Graphs and Combinatorics, 2015, 31 : 1473 - 1485
  • [9] Analytic Criterion and Algorithm for the Lowest Common Ancestor of Two Neighboring Nodes in a Complete Binary Tree
    Wang Xingbo
    Zhou Jun
    INTERNATIONAL CONFERENCE ON GRAPHIC AND IMAGE PROCESSING (ICGIP 2012), 2013, 8768
  • [10] RETRACTED: Analytic Criterion And Algorithm For The Lowest Common Ancestor Of Two Neighboring Nodes In A Complete Binary Tree (Retracted Article)
    Wang Xingbo
    Zhou Jun
    2011 INTERNATIONAL CONFERENCE ON ENERGY AND ENVIRONMENTAL SCIENCE-ICEES 2011, 2011, 11
1