---
tag: RD7XTY6XS8
kind: concept
name: Deck
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section D
    note: adopted
    mention: wikipedia://en/325802#416L
    sections: [Summary]
inventory: [Y31JBM9H2V]
---

## Summary

The multiset of graphs formed from a single graph $G$ by deleting a single vertex in all possible ways, especially in the context of the reconstruction conjecture. An edge-deck is formed in the same way by deleting a single edge in all possible ways. The graphs in a deck are also called *cards*. See also critical (graphs that have a property that is not held by any card) and hypo- (graphs that do not have a property that is held by all cards).