The size of a graph is reconstructible from any \(n-2\) cards

DOI10.1016/j.disc.2017.08.026zbMath1372.05141OpenAlexW2755285488MaRDI QIDQ2411612

Yanyan Li

Publication date: 24 October 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.08.026

zbMATH Keywords

vertex-deleted subgraphsgraph reconstructioncommon cardssize reconstruction

Mathematics Subject Classification ID

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

Related Items (3)

A property of most of the known non-reconstructible digraphs ⋮ Reconstructing the degree sequence of a sparse graph from a partial deck ⋮ Size reconstructibility of graphs

Cites Work

• A congruence theorem for trees
• The degree sequence is reconstructible from \(n-1\) cards
• A new approach to graph reconstruction using supercards
• Towards size reconstruction from fewer cards
• Families of pairs of graphs with a large number of common cards
• Recognizing connectedness from vertex-deleted subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The size of a graph is reconstructible from any \(n-2\) cards