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

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

A graph is ℓ - reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting ℓ 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-reconstructib...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics 2023-10, Vol.39 (5), Article 94
Hauptverfasser: West, Douglas B., Zhu, Xuding
Format: Artikel
Sprache:eng
Schlagworte:
Apexes
Combinatorics
Engineering Design
Graph theory
Graphs
Mathematics
Mathematics and Statistics
Original Paper
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A graph is ℓ - reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting ℓ 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.
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-023-02693-1