MyWikiBiz, Author Your Legacy — Thursday November 21, 2024
Jump to navigationJump to search
528 bytes added
, 11:38, 6 September 2007
Line 1: |
Line 1: |
− | {{for|an introduction to graph theory|Graph (mathematics)}}
| + | : ''For an introduction to graph theory see [[Graph (mathematics)]]''. |
| | | |
| In [[mathematics]] and [[computer science]], '''graph theory''' has for its subject matter the properties of ''[[graph (mathematics)|graphs]]''. Informally speaking, a graph is a set of objects called ''points'' or ''vertices'' connected by links called ''lines'' or ''edges''. 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''. | | In [[mathematics]] and [[computer science]], '''graph theory''' has for its subject matter the properties of ''[[graph (mathematics)|graphs]]''. Informally speaking, a graph is a set of objects called ''points'' or ''vertices'' connected by links called ''lines'' or ''edges''. 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''. |
| | | |
| ==History== | | ==History== |
| + | |
| One of the first results in graph theory appeared in [[Leonhard Euler]]'s paper on ''[[Seven Bridges of Königsberg]]'', published in [[1736]]. It is also regarded as one of the first topological results in geometry; that is, it does not depend on any measurements. This illustrates the deep connection between graph theory and [[topology]]. | | One of the first results in graph theory appeared in [[Leonhard Euler]]'s paper on ''[[Seven Bridges of Königsberg]]'', published in [[1736]]. It is also regarded as one of the first topological results in geometry; that is, it does not depend on any measurements. This illustrates the deep connection between graph theory and [[topology]]. |
| | | |
Line 239: |
Line 240: |
| *[http://www1.cs.columbia.edu/~sanders/graphtheory/ Graph Theory Resources] | | *[http://www1.cs.columbia.edu/~sanders/graphtheory/ Graph Theory Resources] |
| * {{MathWorld | urlname=GraphTheory | title=Graph Theory }}, hosted by the makers of ''[[Mathematica]][http://www.wolfram.com/]'' | | * {{MathWorld | urlname=GraphTheory | title=Graph Theory }}, hosted by the makers of ''[[Mathematica]][http://www.wolfram.com/]'' |
| + | |
| + | ==Document history== |
| + | |
| + | Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders. |
| + | |
| + | * [http://www.getwiki.net/-Graph_theory Graph theory], [http://www.getwiki.net/ GetWiki]. |
| + | |
| + | * [http://wikinfo.org/index.php/Graph_theory Graph theory], [http://wikinfo.org/index.php/Main_Page Wikinfo]. |
| + | |
| + | * [http://en.wikipedia.org/wiki/Graph_theory Graph_theory], [http://en.wikipedia.org/ Wikipedia]. |
| | | |
| [[Category:Combinatorics]] | | [[Category:Combinatorics]] |