Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: dual graph

Re: dual graph

From: Chris Smith <cdsmith_at_twu.net>
Date: Mon, 26 Jun 2006 11:01:58 -0600
Message-ID: <MPG.1f09c0f3ccae898898970e@news.altopia.net>


Marshall <marshall.spight_at_gmail.com> wrote:
> I would have thought that to call an acyclic graph a tree, it would
> have to have a distinguished node. Yes? No? My answer to
> David's question would have been "acyclic." But again: not my field.

In graph theory, no, a tree need not have any specific root node. At least, I've never seen anyone in graph theory define a tree with a distinguished root node. It's not really my field, either... more of a casual interest.

-- 
Chris Smith - Lead Software Developer / Technical Trainer
MindIQ Corporation
Received on Mon Jun 26 2006 - 12:01:58 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US