2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs

DOI10.1007/S00373-023-02693-1zbMATH Open1519.05177MaRDI QIDQ6133663FDOQ6133663

Xuding Zhu, Douglas B. West

Publication date: 21 August 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

strongly regular graphdistance-regular graphreconstruction conjecture2-partially distance-regular2-reconstructibility

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A course in combinatorics.
• Algebraic Graph Theory
• On almost distance-regular graphs
• Distance-regular graphs
• A congruence theorem for trees
• On reconstruction of graphs
• Some basic observations on Kelly's conjecture for graphs
• Strongly Regular Graphs
• Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
• The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one
• Reconstruction from the deck of ‐vertex induced subgraphs
• 3-regular graphs are 2-reconstructible
• On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices

This page was built for publication: 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133663)