Graph Theory
Outline
Undirected Graph
- Definition
- An undirected graph G=(V,E) consists of a set of vertices (nodes) V and a set of edges E, where each edge is an unordered pair of distinct vertices {u,v}
- Connections are bidirectional: if a path exists from u to v, it automatically exists from v to u
- Key Properties
- Symmetry: {u,v} is identical to {v,u}
- Adjacency Matrix: The adjacency matrix is always symmetric
