Re: Related languages (Re: A China-Sumer connection)

From: Brian M. Scott (b.scott_at_csuohio.edu)
Date: 03/29/05 

Date: Tue, 29 Mar 2005 12:42:13 -0500

On Tue, 29 Mar 2005 12:42:37 +1000, Jacques Guy
<jguy@alphalink.com.au> wrote in
<news:4248c09e@news.alphalink.com.au> in
sci.lang,sci.anthropology:

> Brian M. Scott wrote:

>> Ahem. Every tree *is* a connected graph (though not
>> conversely).

> Yes, so much for me. But you must have guessed what
> I meant: a fully connected graph where every node
> is connected to every node.

Ah, a complete graph. No, I actually didn't guess; I
thought that you just meant a connected graph with at least
one cycle (hence not a tree).

[...]

Brian

Relevant Pages

  • Re: Related languages (Re: A China-Sumer connection)
    ... a fully connected graph where every node ... thought that you just meant a connected graph with at least ... one cycle (hence not a tree). ... Brian ...
    (sci.anthropology)
  • Re: Graph Theory Proofs
    ... Let G be a connected graph of order at least two. ... > Corollary 7, G contains a spanning tree, called T, ie T is a tree ... > contains a spanning tree and a tree of order n has ... A tree of order n has size n-1; a forest of order n with k ...
    (sci.math)
  • Graph Theory Proofs
    ... Show that every connected graph G of order at least two ... Corollary 7, G contains a spanning tree, called T, ie T is a tree ... Repeat the process with the vertex xn-1 but only consider ...
    (sci.math)
  • Re: Graph theory
    ... I've also come across a definition that said: "a connected graph with no ... how can a tree have one? ... A trivial cycle can be an edge from a vertex back to itself. ...
    (sci.math)
  • Re: Graph Theory Proofs
    ... Show that every connected graph G of order at least two ... contains vertices x and y such that both G-x and G-y are connected. ... Corollary 7, G contains a spanning tree, called T, ie T is a tree ...
    (sci.math)