Difference between revisions of "Graph theory"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→Description) |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 16: | Line 16: | ||
* [[Computer science]] | * [[Computer science]] | ||
| + | * [[Discrete mathematics]] | ||
* [[Geodesic]] | * [[Geodesic]] | ||
* [[Kruskal's algorithm]] | * [[Kruskal's algorithm]] | ||
Revision as of 17:48, 9 May 2016
In mathematics and computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
Description
A "graph" in this context is made up of "vertices" or "nodes" and lines called edges that connect them.
A graph may be undirected, meaning that there is no distinction between the two vertices associated with each edge, or its edges may be directed from one vertex to another.
See graph (mathematics) for more detailed definitions and for other variations in the types of graph that are commonly considered.
Graphs are one of the prime objects of study in discrete mathematics.
Refer to the glossary of graph theory for basic definitions in graph theory.
See also
External links
- Graph theory @ Wikipedia
- Glossary of graph theory @ Wikipedia
