This page provides definitions and examples of graph properties like adjacency, vertex degrees, and types of graphs (regular, complete, bipartite). It covers subgraphs, graph complements, and duals, a...This page provides definitions and examples of graph properties like adjacency, vertex degrees, and types of graphs (regular, complete, bipartite). It covers subgraphs, graph complements, and duals, along with practice checkpoints for calculating degrees and understanding independent sets and maximum matchings. Each definition is illustrated with examples to aid in the comprehension of graph theory concepts.
We’ll begin this section by introducing a basic operation that can change a graph (or a multigraph, with or without loops) into a smaller graph: deletion. Then, we will define a very important family ...We’ll begin this section by introducing a basic operation that can change a graph (or a multigraph, with or without loops) into a smaller graph: deletion. Then, we will define a very important family of graphs, called complete graphs. Finally, we will introduce Euler's Handshaking Lemma.
