Difference between revisions of "Talk:Graph (graph theory)"
(leave message) |
(update) |
||
Line 1: | Line 1: | ||
− | {{WotW|week=December 6-12|prevweek=[[William Lowell Putnam Mathematical Competition]]<br />[[Diophantine equation]]|curweek=[[Graph (graph theory)]]<br />[[Carl Friedrich Gauss]]}} | + | {{WotW|week=December 6-12|prevweek=[[William Lowell Putnam Mathematical Competition]]<br />[[Diophantine equation]]|curweek=[[Graph (graph theory)]]<br />[[Carl Friedrich Gauss]]|nextweek=[[Euclidean algorithm]]<br />[[Euclid]]}} |
Things that need to be added to this article: | Things that need to be added to this article: |
Revision as of 23:12, 10 January 2008
AoPSWiki Words of the Week for December 6-12 | ||
Previous week William Lowell Putnam Mathematical Competition Diophantine equation |
Current week Graph (graph theory) Carl Friedrich Gauss |
Next week Euclidean algorithm Euclid |
Things that need to be added to this article:
A proper definition of a graph. ("Formally, a graphDoneis 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.
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)