Paragraph

Sometimes we will talk about a graph with a special name (like \(K_n\) or the Petersen graph) or perhaps draw a graph without any labels. In this case we are really referring to all graphs isomorphic to any copy of that particular graph. A collection of isomorphic graphs is often called an isomorphism class. ¹