A generalization of Fiedler's lemma and the spectra of H-join of graphs

被引:9
|
作者
Saravanan, M. [1 ]
Murugan, S. P. [2 ]
Arunkumar, G. [3 ]
机构
[1] Erstwhile Madurai Kamaraj Univ, Govt Arts & Sci Coll, Constituent Coll, Sattur, India
[2] Indian Inst Sci Educ & Res, Mohali, India
[3] Indian Inst Sci, Bangalore, Karnataka, India
关键词
Graph operations; Graph eigenvalues; Universal adjacency matrix; EIGENVALUES;
D O I
10.1016/j.laa.2021.04.015
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A new generalization of Fiedler's lemma is obtained by introducing the concept of the main function of a matrix. As applications, the universal spectra of the H-join of any graphs (possibly non-regular) and the adjacency spectra of the Hgeneralized join constrained by (arbitrary) vertex subsets are obtained. The adjacency spectra of the generalized corona of graphs is deduced from the spectra of the H-join of graphs. Also, the construction of infinitely many pairs of non-regular universal cospectral graphs is provided. (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页码:20 / 43
页数:24
相关论文
共 50 条
  • [1] DISTANCE SPECTRA OF H-JOIN GRAPHS
    Pokorny, M.
    Hic, P.
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2016, 17 (03): : 305 - 321
  • [2] A generalization of Fiedler's lemma and some applications
    Cardoso, Domingos M.
    Gutman, Ivan
    Martins, Enide Andrade
    Robbiano, Maria
    LINEAR & MULTILINEAR ALGEBRA, 2011, 59 (08): : 929 - 942
  • [3] A generalization of Fiedler's lemma and its applications
    Wu, Yangyang
    Ma, Xiaoling
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2024, 699 : 604 - 620
  • [4] Distance matrices on the H-join of graphs: A general result and applications
    Cardoso, Domingos M.
    Diaz, Roberto C.
    Rojo, Oscar
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2018, 559 : 34 - 53
  • [5] Signless Laplacian and normalized Laplacian on the H-join operation of graphs
    Wu, Bao-Feng
    Lou, Yuan-Yuan
    He, Chang-Xiang
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (03)
  • [6] H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
    Bui-Xuan, Binh-Minh
    Telle, Jan Arne
    Vatshelle, Martin
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (07) : 809 - 819
  • [7] H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
    Department of Informatics, University of Bergen, Norway
    Discrete Appl Math, 7 (809-819):
  • [8] The H-join of arbitrary families of graphs- the universal adjacency spectrum
    Cardoso, Domingos M.
    Gomes, Helena
    Pinheiro, Sofia J.
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2022, 648 : 160 - 180
  • [9] Spectra of graphs obtained by a generalization of the join graph operation
    Cardoso, Domingos M.
    de Freitas, Maria Aguieiras A.
    Martins, Enide Andrade
    Robbiano, Maria
    DISCRETE MATHEMATICS, 2013, 313 (05) : 733 - 741
  • [10] Algorithms for Some H-Join Decompositions
    Habib, Michel
    Mamcarz, Antoine
    de Montgolfier, Fabien
    LATIN 2012: THEORETICAL INFORMATICS, 2012, 7256 : 446 - 457