2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs
From MaRDI portal
Publication:6133663
Recommendations
Cites work
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3805595 (Why is no real title available?)
- 3-regular graphs are 2-reconstructible
- A congruence theorem for trees
- A course in combinatorics.
- Algebraic Graph Theory
- Distance-regular graphs
- Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
- On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices
- On almost distance-regular graphs
- On reconstruction of graphs
- Reconstruction from the deck of \(k\)-vertex induced subgraphs
- Some basic observations on Kelly's conjecture for graphs
- Strongly regular graphs
- The 2-partially distance-regular graphs such that their second largest local eigenvalues are at most one
Cited in
(2)
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)