(New page: == '''Graphs''' == Definition: '''A graph is a collection of things (usually called vertices) together with a collection of pairs of vertices (called edges)''' Note: '''Edges''' are '''N...) |
|||
| Line 10: | Line 10: | ||
The degree of a vertex, '''deg(v) = 2 x # of loops based at v + 1 x # of nonloop edges involving v''' | The degree of a vertex, '''deg(v) = 2 x # of loops based at v + 1 x # of nonloop edges involving v''' | ||
| + | |||
| + | ---- | ||
| + | |||
| + | For an undirected graph, G, with n vertices, <math>\sum_{i=0}^ndeg(v_i)=2E</math> | ||
| + | |||
| + | --[[User:Jniederh|Jniederh]] 00:08, 3 November 2008 (UTC) | ||
Revision as of 19:08, 2 November 2008
Graphs
Definition: A graph is a collection of things (usually called vertices) together with a collection of pairs of vertices (called edges)
Note: Edges are NOT geometric => no specific shape, form length
Graphs can/do have many different visualization
A simple graph is the one without loops, without multiple edges.
The degree of a vertex, deg(v) = 2 x # of loops based at v + 1 x # of nonloop edges involving v
For an undirected graph, G, with n vertices, $ \sum_{i=0}^ndeg(v_i)=2E $
--Jniederh 00:08, 3 November 2008 (UTC)
