2-Reconstructibility of Strongly Regular Graphs and 2-Partially Distance-Regular Graphs

被引：0
作者：
West, Douglas B. [1 ,2 ]
Zhu, Xuding [1 ]
机构：
[1] Zhejiang Normal Univ, Jinhua, Peoples R China
[2] Univ Illinois, Urbana, IL 61820 USA
来源：
GRAPHS AND COMBINATORICS | 2023年 / 39卷 / 05期
基金：
中国国家自然科学基金;
关键词：
Reconstruction Conjecture; 2-reconstructibility; Strongly regular graph; Distance-regular graph; 2-partially distance-regular; RECONSTRUCTION;
D O I：
10.1007/s00373-023-02693-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph is l-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting l vertices. For graphs with at least six vertices, we prove that all graphs in a family containing all strongly regular graphs and most 2-partially distance regular graphs are 2-reconstructible.
引用
收藏
页数：6
相关论文
共 18 条
  • [1] Biggs N.L., 1993, ALGEBRAIC GRAPH THEO, V2nd, P159
  • [2] Brouwer A.E., 2022, Encyclopedia Math. Appl., V182
  • [3] Brouwer A.E., 1989, DISTANCE REGULAR GRA, P434
  • [4] Chernyak Zh.A., 1982, VESTSI AKAD NAVUK BS, V126, P44
  • [5] On almost distance-regular graphs
    Dalfo, C.
    van Dam, E. R.
    Fiol, M. A.
    Garriga, E.
    Gorissen, B. L.
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2011, 118 (03) : 1094 - 1113
  • [6] Huang T., 2007, PARTIALLY DISTANCE R
  • [7] Kelly P. J., 1957, Pacific J. Math., V7, P961, DOI DOI 10.2140/PJM.1957.7.961
  • [8] Kelly P.J., 1942, THESIS U WISCONSIN M
  • [9] On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting l Vertices
    Kostochka, Alexandr, V
    West, Douglas B.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (06) : 3278 - 3286
  • [10] 3-regular graphs are 2-reconstructible
    Kostochka, Alexandr, V
    Nahvi, Mina
    West, Douglas B.
    Zirlin, Dara
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2021, 91
12