Laplacian spectral characterization of disjoint union of paths and cycles

被引：9
|
作者：
Wang, J. F. [2 ,3 ]
Simic, S. K. [4 ]
Huang, Q. X. [3 ]
Belardo, F. [1 ]
Li Marzi, E. M. [1 ]
机构：
[1] Univ Messina, Dept Math, I-98166 Messina, Italy
[2] Qinghai Normal Univ, Dept Math, Xining 810008, Qinghai, Peoples R China
[3] Xinjiang Univ, Coll Math & Syst Sci, Urumqi 830046, Peoples R China
[4] Math Inst SANU, Belgrade 11001, Serbia
来源：
LINEAR & MULTILINEAR ALGEBRA | 2011年 / 59卷 / 05期
关键词：
Laplacian spectrum; cospectral graphs; spectral characterization; spectral determination; GRAPHS;
D O I：
10.1080/03081081003605777
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The Laplacian spectrum of a graph consists of the eigenvalues (together with multiplicities) of the Laplacian matrix. In this article we determine, among the graphs consisting of disjoint unions of paths and cycles, those ones which are determined by the Laplacian spectrum. For the graphs, which are not determined by the Laplacian spectrum, we give the corresponding cospectral non-isomorphic graphs.
引用
收藏
页码：531 / 539
页数：9
相关论文
共 50 条
  • [1] Signless Laplacian spectral characterization of some disjoint union of graphs
    B. R. Rakshith
    Indian Journal of Pure and Applied Mathematics, 2022, 53 : 233 - 245
  • [2] Signless Laplacian spectral characterization of some disjoint union of graphs
    Rakshith, B. R.
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2022, 53 (01): : 233 - 245
  • [3] GAME DOMINATION NUMBERS OF A DISJOINT UNION OF PATHS AND CYCLES
    Ruksasakchai, Watcharintorn
    Onphaeng, Kritkhajohn
    Worawannotai, Chalermpong
    QUAESTIONES MATHEMATICAE, 2019, 42 (10) : 1357 - 1372
  • [4] Kernel bounds for disjoint cycles and disjoint paths
    Bodlaender, Hans L.
    Thomasse, Stephan
    Yeo, Anders
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (35) : 4570 - 4578
  • [5] Kernel Bounds for Disjoint Cycles and Disjoint Paths
    Bodlaender, Hans L.
    Thomasse, Stephan
    Yeo, Anders
    ALGORITHMS - ESA 2009, PROCEEDINGS, 2009, 5757 : 635 - +
  • [6] A remark on the generalized spectral characterization of the disjoint union of graphs
    Wang, Wei
    Mao, Lihuan
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2017, 518 : 1 - 13
  • [7] A note on even disjoint union of paths
    Baca, Martin
    Lin, Yuqing
    Muntaner-Batle, Francesc A.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2009, 6 (01) : 41 - 45
  • [8] Disjoint paths, planarizing cycles, and spanning walks
    Yu, XX
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1997, 349 (04) : 1333 - 1358
  • [9] Disjoint directed and undirected paths and cycles in digraphs
    Bang-Jensen, Jorgen
    Kriesell, Matthias
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5138 - 5144
  • [10] Splitting a graph into disjoint induced paths or cycles
    Le, HO
    Le, VB
    Müller, H
    DISCRETE APPLIED MATHEMATICS, 2003, 131 (01) : 199 - 212
12345