Difference between revisions of "Undirected graph"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (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,...") |
(No difference)
|
Revision as of 05:44, 28 May 2016
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, 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
- Graph (discrete mathematics): Undirected graph @ Wikipedia
