ultrahomogeneous graph
graph in which every isomorphism between two of its induced subgraphs of at most k vertices can be extended to an automorphism of the whole graph
Rado graph
infinite graph containing all countable graphs
cluster graph
graph in which each component is a clique
Henson graph
type of infinite graph