Karl Jones at 11:47, 28 May 2016

2016-05-28T11:47:32Z

Karl Jones: Created page with "In graph theory, an undirected graph is a graph in which edges have no orientation. The edge (x, y) is identical to the edge (y,..."

2016-05-28T11:44:16Z

Created page with "In graph theory, an undirected graph is a graph in which edges have no orientation. The edge (x, y) is identical to the edge (y,..."

New page

In [[graph theory]], an undirected graph is a [[Graph (discrete mathematics)|graph]] in which [[edges]] have no [[orientation]].

The edge (x, y) is identical to the edge (y, x), i.e., they are not ordered pairs, but sets {x, y} (or 2-multisets) of [[vertices]].

The maximum number of edges in an undirected graph without a [[loop]] is n(n − 1)/2.

== See also ==

* [[Apollonian network]]
* [[Conceptual graph]]
* [[Dual graph]]
* [[Glossary of graph theory]]
* [[Graph (abstract data type)]]
* [[Graph (discrete mathematics)]]
* [[Graph database]]
* [[Graph drawing]]
* [[Graph theory]]
* [[Hypergraph]]
* [[List of graph theory topics]]
* [[List of publications in graph theory]]
* [[Network theory]]

== External links ==

* [https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)#Undirected_graph Graph (discrete mathematics): Undirected graph] @ Wikipedia

[[Category:Graph theory]]
[[Category:Mathematics]]

← Older revision		Revision as of 11:47, 28 May 2016
Line 1:		Line 1:
−	In [[graph theory]], an undirected graph is a [[Graph (discrete mathematics)\|graph]] in which [[edges]] have no [[orientation]].	+	[[File:Undirected-graph.png\|thumb\|Simple undirected graph.]]In [[graph theory]], an '''undirected graph''' is a [[Graph (discrete mathematics)\|graph]] in which [[edges]] have no [[orientation]].

	The edge (x, y) is identical to the edge (y, x), i.e., they are not ordered pairs, but sets {x, y} (or 2-multisets) of [[vertices]].		The edge (x, y) is identical to the edge (y, x), i.e., they are not ordered pairs, but sets {x, y} (or 2-multisets) of [[vertices]].

Undirected graph - Revision history

Karl Jones at 11:47, 28 May 2016

Karl Jones: Created page with "In graph theory, an undirected graph is a graph in which edges have no orientation. The edge (x, y) is identical to the edge (y,..."