Talk:Path (graph theory)

From Wikipedia, the free encyclopedia

"A path is called a cycle if its start vertex is also its end vertex."
"A cycle with no repeated vertices is called simple cycle."
that means every cycle isn't simple cycle because start vertex and end vetex are same???--Sukolsak 10:25, 8 May 2005 (UTC)

• They are the same, but they are not repeated. I have my mother and my brother has his mother, but there are no two mothers in our family. Mikkalai 02:09, 9 May 2005 (UTC)

[edit] This article is a glossary

Does this article add anything beyond what's in Glossary of graph theory? Maybe we should just merge it in there. --P3d0 13:58, 9 May 2006 (UTC)

[edit] Expert tag

I removed the expert tag; if there are specific concerns, please list them on the talk page. I added an unreferenced tag; just one or two standard reference texts would suffice, but I am not familiar with any. CMummert 19:58, 15 July 2006 (UTC)

[edit] Cite sources?!

Why the devil should anyone need to cite sources for this page!? This is all such universal knowledge I don't even know what you would cite! Wikipedia is ridiculous.

I think we should cite the appropriate pages of a graph theory text or three, in the style suggested by Wikipedia:Scientific citation guidelines: a sentence near the start saying that this is elementary material that can be found in any graph theory text such as (whatever citation we end up using). Obviously, it's too basic to find much in the way of relevant journal articles or for line-by-line citation to be useful, but that doesn't mean it's impossible for any citations to be useful. —David Eppstein 00:24, 13 November 2006 (UTC)