A graph card, or simply card, of a graph 
is one of the one-vertex-deleted vertex-induced
subgraphs 
occurring in the graph deck of 
, usually considered up to graph
isomorphism. If two deleted vertices give isomorphic subgraphs, the corresponding
card occurs in the deck with multiplicity, since the graph deck is a multiset.
The terminology is by analogy with a card in a deck of playing cards. The illustration
above shows a graph 
with vertex 3 highlighted, together with the corresponding graph card 
obtained by deleting vertex 3 and all edges incident to
it.
