Difference between revisions of "Talk:Graph (graph theory)"
(fix) |
|||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
| − | |||
| − | |||
Things that need to be added to this article: | Things that need to be added to this article: | ||
* <s>A proper definition of a graph. ("Formally, a graph <math>G</math> is a pair, <math>G = (V, E)</math>, of a set <math>V</math> of vertices together with a subset <math>E</math> of pairs of members of <math>V</math>.")</s> '''Done''' | * <s>A proper definition of a graph. ("Formally, a graph <math>G</math> is a pair, <math>G = (V, E)</math>, of a set <math>V</math> of vertices together with a subset <math>E</math> of pairs of members of <math>V</math>.")</s> '''Done''' | ||
* [[Directed graph]]s, [[multigraph]]s, <s>loopless graphs, simple graphs, and the distinctions between these.</s> | * [[Directed graph]]s, [[multigraph]]s, <s>loopless graphs, simple graphs, and the distinctions between these.</s> | ||
| − | * <s>"Path," | + | * <s>"Path," "tree," "forest," "circuit" or "cycle,"</s> "Hamiltonian path" (and circuit and cycle), etc. |
* To distinguish between a formal graph (a pair of two sets) and a geometric realization of a graph. | * To distinguish between a formal graph (a pair of two sets) and a geometric realization of a graph. | ||
* Most of these words deserve their own page and so should be linked to. | * Most of these words deserve their own page and so should be linked to. | ||
| Line 13: | Line 11: | ||
:: Thanks. I'll continue to make some of the satellite pages and add to this one. --[[User:JBL|JBL]] 12:04, 11 January 2008 (EST) | :: Thanks. I'll continue to make some of the satellite pages and add to this one. --[[User:JBL|JBL]] 12:04, 11 January 2008 (EST) | ||
| + | |||
| + | |||
| + | |||
| + | {{WotW|week=January 3-9|prevweek=[[William Lowell Putnam Mathematical Competition]]<br />[[Diophantine equation]]|curweek=[[Graph (graph theory)]]<br />[[Carl Friedrich Gauss]]|nextweek=[[Euclidean algorithm]]<br />[[Euclid]]}} | ||
Latest revision as of 20:46, 28 March 2008
Things that need to be added to this article:
A proper definition of a graph. ("Formally, a graphDone
is a pair, 
, of a set 
of vertices together with a subset 
of pairs of members of .")- Directed graphs, multigraphs,
loopless graphs, simple graphs, and the distinctions between these. "Path," "tree," "forest," "circuit" or "cycle,""Hamiltonian path" (and circuit and cycle), etc.- To distinguish between a formal graph (a pair of two sets) and a geometric realization of a graph.
- Most of these words deserve their own page and so should be linked to.
is a pair, 
, of a set 
of vertices together with a subset 
of pairs of members of I would have started doing this, but the first two points together are difficult to integrate into a single intro section. Help would be appreciated. --JBL 10:20, 4 January 2008 (EST)
- The words that deserve their own page will be created eventually. For now, I'll just focus on integrating them into the article. I already defined path and cycle... I'll put a definition for tree in there, but I'm afraid that I don't know what some of the terms mean. Temperalxy 13:09, 4 January 2008 (EST)
- Thanks. I'll continue to make some of the satellite pages and add to this one. --JBL 12:04, 11 January 2008 (EST)
| AoPSWiki Words of the Week for January 3-9 | ||
| Previous week William Lowell Putnam Mathematical Competition Diophantine equation |
Current week Graph (graph theory) Carl Friedrich Gauss |
Next week Euclidean algorithm Euclid |
