The local spectra of regular line graphs

被引:1
|
作者
Fiol, M. A. [2 ]
Mitjana, M. [1 ]
机构
[1] Univ Politecn Cataluna, Dept Matemat Aplicada 1, Barcelona, Spain
[2] Univ Politecn Cataluna, Dept Matemat Aplicada 4, Barcelona, Spain
关键词
Graph spectrum; Eigenvalue; Local multiplicity; Line graph; DISTANCE;
D O I
10.1016/j.disc.2009.03.034
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The local spectrum of a graph G = (V, E), constituted by the standard eigenvalues of G and their local multiplicities, plays a similar role as the global spectrum when the graph is "seen" from a given vertex. Thus. for each vertex i is an element of V, the i-local multiplicities of all the eigenvalues add up to 1; whereas the multiplicity of each eigenvalue lambda of G is the sum, extended to all vertices, of its local multiplicities. In this work, using the interpretation of an eigenvector as a charge distribution on the vertices, we compute the local spectrum of the line graph LG in terms of the local spectrum of the regular graph G it derives from. Furthermore, some applications of this result are derived as, for instance, some results about the number of circuits of LG. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:511 / 517
页数:7
相关论文
共 50 条
  • [31] A 1-FACTORIZATION OF THE ITERATED LINE GRAPHS OF REGULAR GRAPHS
    ZHAO, GF
    [J]. CHINESE SCIENCE BULLETIN, 1993, 38 (02): : 89 - 93
  • [32] Line graphs associated to Von Neumann regular graphs of rings
    Boro, Laithun
    Singh, Madan Mohan
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (02)
  • [33] Regular product vague graphs and product vague line graphs
    Ghorai, Ganesh
    Pal, Madhumangal
    [J]. COGENT MATHEMATICS, 2016, 3
  • [34] A 1-Factorization of the Iterated Line Graphs of Regular Graphs
    赵光复
    [J]. Science Bulletin, 1993, (02) : 89 - 93
  • [35] Star Colouring of Regular Graphs Meets Weaving and Line Graphs
    Shalu, M. A.
    Antony, Cyriac
    [J]. ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2024, 2024, 14508 : 313 - 327
  • [36] Network routing on regular digraphs and their line graphs
    Vance Faber
    Noah Streib
    [J]. Journal of Scheduling, 2024, 27 (6) : 557 - 564
  • [37] Local Approximation of the Maximum Cut in Regular Graphs
    Bamas, Etienne
    Esperet, Louis
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 66 - 78
  • [38] Local Semicircle Law for Random Regular Graphs
    Bauerschmidt, Roland
    Knowles, Antti
    Yau, Horng-Tzer
    [J]. COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2017, 70 (10) : 1898 - 1960
  • [39] Comments to "The line graphs of lollipop graphs are determined by their spectra"
    Wang, JianFeng
    Yan, Juan
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 440 : 342 - 344
  • [40] Local approximation of the Maximum Cut in regular graphs
    Bamas, Etienne
    Esperet, Louis
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 820 (45-59) : 45 - 59