Constructing cospectral hypergraphs

被引：1
|
作者：
Abiad, Aida [1 ,2 ,3 ]
Khramova, Antonina P. [1 ]
机构：
[1] Eindhoven Univ Technol, Dept Math & Comp Sci, Groene Loper 3, NL-5612 AE Eindhoven, Netherlands
[2] Univ Ghent, Dept Math Anal Log & Discrete Math, Ghent, Belgium
[3] Vrije Univ Brussel, Dept Math & Data Sci, Brussels, Belgium
来源：
LINEAR & MULTILINEAR ALGEBRA | 2025年 / 73卷 / 04期
基金：
荷兰研究理事会;
关键词：
Cospectral hypergraphs; E-cospectral hypergraphs; adjacency tensor; matrix representation; SPECTRA; EIGENVALUES; PRODUCT;
D O I：
10.1080/03081087.2024.2382992
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be deduced from their spectra. In this paper, we show a new method for constructing cospectral uniform hypergraphs using two well-known hypergraph representations: adjacency tensors and adjacency matrices.
引用
收藏
页码：729 / 740
页数：12
相关论文
共 50 条
  • [1] E-cospectral hypergraphs and some hypergraphs determined by their spectra
    Bu, Changjiang
    Zhou, Jiang
    Wei, Yimin
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 459 : 397 - 403
  • [2] Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral
    Tingzeng Wu
    Hong-Jian Lai
    Graphs and Combinatorics, 2018, 34 : 1713 - 1721
  • [3] Constructing cospectral signed graphs
    Belardo, Francesco
    Brunetti, Maurizio
    Cavaleri, Matteo
    Donno, Alfredo
    LINEAR & MULTILINEAR ALGEBRA, 2021, 69 (14): : 2717 - 2732
  • [4] Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral
    Wu, Tingzeng
    Lai, Hong-Jian
    GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1713 - 1721
  • [5] Constructing cospectral bipartite graphs
    Ji, Yizhe
    Gong, Shicai
    Wang, Wei
    DISCRETE MATHEMATICS, 2020, 343 (10)
  • [6] Constructing families of cospectral regular graphs
    Haythorpe, M.
    Newcombe, A.
    COMBINATORICS PROBABILITY & COMPUTING, 2020, 29 (05): : 664 - 671
  • [7] A switching method for constructing cospectral gain graphs
    Abiad, Aida
    Belardo, Francesco
    Khramova, Antonina P.
    DISCRETE MATHEMATICS, 2024, 347 (04)
  • [8] Constructing pairs of equienergetic and non-cospectral graphs
    Bonifacio, Andreas S.
    Vinagre, Cybele T. M.
    de Abreu, Nair Maria Maia
    APPLIED MATHEMATICS LETTERS, 2008, 21 (04) : 338 - 341
  • [9] Constructing cospectral graphs by unfolding non-bipartite graphs☆
    Kannan, M. Rajesh
    Pragada, Shivaramakrishna
    Wankhede, Hitesh
    DISCRETE APPLIED MATHEMATICS, 2024, 357 : 264 - 273
  • [10] Constructing non-isomorphic signless Laplacian cospectral graphs
    Dutta, Supriyo
    DISCRETE MATHEMATICS, 2020, 343 (04)
12345