Spectra of generalized Bethe trees attached to a path

被引:9
|
作者
Rojo, Oscar [1 ]
Medina, Luis [1 ]
机构
[1] Univ Catolica Norte, Dept Matemat, Antofagasta, Chile
关键词
Tree; Bethe tree; Generalized Bethe tree; Laplacian matrix; Adjacency matrix; Algebraic connectivity;
D O I
10.1016/j.laa.2008.08.009
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A generalized Bethe tree is a rooted tree in which vertices at the same distance from the root have the same degree. Let P-m be a path of m vertices. Let {B-i : 1 <= i <= m} be a set of generalized Bethe trees. Let P-m {B-i : 1 <= i <= m} be the tree obtained from P-m and the trees B-1, B-2, ..., B-m by identifying the root vertex of B-i with the ith vertex of P-m. We give a complete characterization of the eigenvalues of the Laplacian and adjacency matrices of P-m{B-i : 1 <= i <= m}. In particular, we characterize their spectral radii and the algebraic conectivity. Moreover, we derive results concerning their multiplicities. Finally, we apply the results to the case B-1 = B-2 = ... = B-m. (C) 2008 Elsevier Inc. All rights reserved.
引用
收藏
页码:483 / 503
页数:21
相关论文
共 50 条
  • [31] Generalized edge-rankings of trees
    Zhou, X
    Kashem, A
    Nishizeki, T
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1998, E81A (02) : 310 - 320
  • [32] Generalized edge-rankings of trees
    Zhou, X
    Kashem, MA
    Nishizeki, T
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1997, 1197 : 390 - 404
  • [33] The Ramsey Numbers of Trees Versus Generalized Wheels
    Wang, Longqin
    Chen, Yaojun
    GRAPHS AND COMBINATORICS, 2019, 35 (01) : 189 - 193
  • [34] Generalized (P, ω)-partitions and generating functions for trees
    Arima, I
    Tagawa, H
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2003, 103 (01) : 137 - 150
  • [35] Maximizing and minimizing the number of generalized colorings of trees
    Engbers, John
    Stocker, Christopher
    DISCRETE MATHEMATICS, 2019, 342 (04) : 1048 - 1055
  • [36] The Ramsey Numbers of Trees Versus Generalized Wheels
    Longqin Wang
    Yaojun Chen
    Graphs and Combinatorics, 2019, 35 : 189 - 193
  • [37] On the minimum vertex k-path cover of trees
    Lemanska, Magdalena
    UTILITAS MATHEMATICA, 2016, 100 : 299 - 307
  • [38] On the Alexander dual of the path ideals of rooted and unrooted trees
    Nasernejad, Mehrdad
    Khashyarmanesh, Kazem
    COMMUNICATIONS IN ALGEBRA, 2017, 45 (05) : 1853 - 1864
  • [39] A generalized enumeration of labeled trees and reverse Prufer algorithm
    Seo, Seunghyun
    Shin, Heesung
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2007, 114 (07) : 1357 - 1361
  • [40] The Ramsey Numbers of Trees Versus Generalized 6-Wheels or Generalized 7-Wheels
    Longqin Wang
    Graphs and Combinatorics, 2022, 38