-
Simple Graph
-
Undirected
-
has no loops
-
no more than one edge between any two different vertices
-
Regular Graph
- each vertex has the same number of neighbors
-
Complete Graph
- each pair of vertices has an edge connecting them
-
Path
- a sequence of vertices such that from each of its vertices there is an edge to the next vertex in the sequence
-
A tree is a connected graph with no cycles.
-
A forest is a graph with no cycles
Created
September 26, 2012 06:25
-
-
Save suzaku/3786423 to your computer and use it in GitHub Desktop.
About Graph
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment