Graph (discrete mathematics): Difference between revisions

Revision as of 18:57, 26 June 2006

Revision as of 19:58, 26 June 2006

Line 3:

[[Image:6n-graf.svg|thumb|250px|A labeled graph on 6 vertices and 7 edges.]]

In [[mathematics]] and [[computer science]], a '''graph''' is the basic object of study in [[graph theory]]. Informally speaking, a graph is a set of objects called ''points'' or ''[[vertex|vertices]]'' connected by links called ''lines'' or ''[[edge]]sedges''. In a graph proper, which is by default ''undirected'', a line from point ''A'' to point ''B'' is considered to be the same thing as a line from point ''B'' to point ''A''. In a ''digraph'', short for ''directed graph'', the two directions are counted as being distinct ''arcs'' or ''directed edges''. Typically, a graph is depicted in diagrammatic form as a set of dots (for the points, vertices, or nodes), joined by curves (for the lines or edges).

==Definitions==