Constructing families of cospectral regular graphs

被引：1
|
作者：
Haythorpe, M. [1 ]
Newcombe, A. [1 ]
机构：
[1] Flinders Univ S Australia, 1284 South Rd, Tonsley, SA 5042, Australia
来源：
COMBINATORICS PROBABILITY & COMPUTING | 2020年 / 29卷 / 05期
关键词：
05C50; 05C07;
D O I：
10.1017/S096354832000019X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid for special cases of a property introduced by Schwenk. For the case of cubic (3-regular) graphs, computational results are given which show that the construction generates a large proportion of the cubic graphs, which are cospectral with another cubic graph.
引用
收藏
页码：664 / 671
页数：8
相关论文
共 50 条
  • [1] Constructing cospectral signed graphs
    Belardo, Francesco
    Brunetti, Maurizio
    Cavaleri, Matteo
    Donno, Alfredo
    LINEAR & MULTILINEAR ALGEBRA, 2021, 69 (14): : 2717 - 2732
  • [2] Constructing cospectral bipartite graphs
    Ji, Yizhe
    Gong, Shicai
    Wang, Wei
    DISCRETE MATHEMATICS, 2020, 343 (10)
  • [3] Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral
    Tingzeng Wu
    Hong-Jian Lai
    Graphs and Combinatorics, 2018, 34 : 1713 - 1721
  • [4] CONSTRUCTION OF COSPECTRAL REGULAR GRAPHS
    Bapat, Ravindra B.
    Karimi, Masoud
    MATEMATICKI VESNIK, 2016, 68 (01): : 66 - 76
  • [5] Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral
    Wu, Tingzeng
    Lai, Hong-Jian
    GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1713 - 1721
  • [6] Constructing cospectral graphs via regular rational orthogonal matrices with level two
    Mao, Lihuan
    Wang, Wei
    Liu, Fenjin
    Qiu, Lihong
    DISCRETE MATHEMATICS, 2023, 346 (01)
  • [7] Large families of cospectral graphs
    Seress, A
    DESIGNS CODES AND CRYPTOGRAPHY, 2000, 21 (1-3) : 205 - 208
  • [8] Large Families of Cospectral Graphs
    Akos Seress
    Designs, Codes and Cryptography, 2000, 21 : 205 - 208
  • [9] CONSTRUCTION OF COSPECTRAL INTEGRAL REGULAR GRAPHS
    Bapat, Ravindra B.
    Karimi, Masoud
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (03) : 595 - 609
  • [10] Constructing cospectral graphs by unfolding non-bipartite graphs☆
    Kannan, M. Rajesh
    Pragada, Shivaramakrishna
    Wankhede, Hitesh
    DISCRETE APPLIED MATHEMATICS, 2024, 357 : 264 - 273
12345