Upper Bound for the Diameter of a Tree in the Quantum Graph Theory

被引：0
|
作者：
Boyko, O. P. [1 ]
Martynyuk, O. M. [1 ]
Pivovarchik, V. M. [1 ]
机构：
[1] K Ushyns Kyi South Ukrainian Natl Pedag Univ, Odessa, Ukraine
来源：
UKRAINIAN MATHEMATICAL JOURNAL | 2023年 / 74卷 / 08期
关键词：
EIGENVALUES;
D O I：
10.1007/s11253-023-02128-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We study two Sturm-Liouville spectral problems on an equilateral tree with continuity and Kirchhoff conditions at the internal vertices and Neumann conditions at the pendant vertices (first problem) and with Dirichlet conditions at the pendant vertices (second problem). The spectrum of each of these problems consists of infinitely many normal (isolated Fredholm) eigenvalues. It is shown that if we know the asymptotics of eigenvalues, then it is possible to estimate the diameter of a tree from above for each of these problems.
引用
收藏
页码：1165 / 1174
页数：10
相关论文
共 50 条
  • [41] UPPER BOUND ON POINT-ARBORICITY OF A GRAPH
    LICK, DR
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (01): : A9 - A9
  • [42] An upper bound for the Laplacian index of a signed graph
    Ramezani, Farzaneh
    Stanic, Zoran
    DISCRETE MATHEMATICS LETTERS, 2021, 5 : 24 - 28
  • [43] ON AN UPPER BOUND FOR THE HARMONIOUS CHROMATIC NUMBER OF A GRAPH
    LU, ZK
    JOURNAL OF GRAPH THEORY, 1991, 15 (04) : 345 - 347
  • [44] Improving an Upper Bound on the Stability Number of a Graph
    Carlos J. Luz
    Journal of Global Optimization, 2005, 31 : 61 - 84
  • [45] A New Upper Bound for Laplacian Graph Eigenvalues
    Hu, Shengbiao
    INTERNATIONAL ELECTRONIC CONFERENCE ON COMPUTER SCIENCE, 2008, 1060 : 298 - 301
  • [46] A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH
    MARCU, D
    QUARTERLY JOURNAL OF MATHEMATICS, 1985, 36 (142): : 221 - 223
  • [47] AN UPPER BOUND ON THE SIZE OF THE LARGEST CLIQUES IN A GRAPH
    BILLIONNET, A
    JOURNAL OF GRAPH THEORY, 1981, 5 (02) : 165 - 169
  • [48] AN UPPER BOUND FOR THE MINIMUM DIAMETER OF INTEGRAL POINT SETS
    HARBORTH, H
    KEMNITZ, A
    MOLLER, M
    DISCRETE & COMPUTATIONAL GEOMETRY, 1993, 9 (04) : 427 - 432
  • [49] An explicit upper bound on disparity for trees of a given diameter
    Cinzori, Isaac
    Johnson, Charles R.
    Lang, Hannah
    LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (19): : 4584 - 4596
  • [50] AN UPPER BOUND ON THE COMPLEXITY OF RECOGNIZABLE TREE LANGUAGES
    Finkel, Olivier
    Lecomte, Dominique
    Simonnet, Pierre
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2015, 49 (02): : 121 - 137
12345