User talk:Djr36

Welcome!

Hello, Djr36, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers:

I hope you enjoy editing here and being a Wikipedian! Please sign your name on talk pages using four tildes (~~~~); this will automatically produce your name and the date. If you need help, check out Wikipedia:Questions, ask me on my talk page, or place {{helpme}} on your talk page and someone will show up shortly to answer your questions. Again, welcome! --Durin 16:38, 16 May 2006 (UTC)[reply]

Mark Inglis

Thanks for creating that article! I've added significantly to it. Feel free to add more. --Durin 16:38, 16 May 2006 (UTC)[reply]

Path (graph theory)

I think this page is factually inaccurrate, but I'm too used to treating Wikipedia as an authority, especially on technical subjects like maths, to have the confidence to change it. "path in a graph is a sequence of vertices such that from each of its vertices there is an edge to the successor vertex" - to my (first year undergraduate in mathematics) mind, this is the definition of a walk, and not even a very good one. A walk is a sequence (ordered set) of vertices and edges such each edge connects the previous vertex to the subsequent one (in the appropriate direction, if it is a directed graph). A path, in contrast, is a walk where no edges are repeated, which is never specified in this definition. I came to wikipedia because the notes from my maths lecturer state that no vertex should be repeated, and fail to mention edges. I need to know for my exam tomorrow whether the edges are important as well.

Is there a handy tag to mark that a page might need the opinion of an expert, or that it might contain information that is less than guaranteed to be certain?

Yes, simply put {{expert}} or {{Not verified}} at the top of the page. Cheers, Tangot a ngo 17:05, 21 May 2006 (UTC)[reply]