Graph Worksheet - Two Rivers High School

A graph in which each vertex is given a unique name or label is called a labeled graph. Cayley’s Theorem: The number of labeled trees with n vertices is nn-2 (n ( 2). Spanning Trees. A tree T is said to be a . spanning tree (skeleton or scaffolding) of a connected graph G if T is a subgraph of G and T contains all the vertices of G. ................
................