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: Marshall <marshall.spight_at_gmail.com>
Date: 26 Jun 2006 09:31:26 -0700
Message-ID: <1151339486.426245.243110@p79g2000cwp.googlegroups.com>


Chris Smith wrote:
> David Cressey <dcressey_at_verizon.net> wrote:
> > Thanks to everybody for clearing up the matter of "planar".
> >
> > Now, I'm interested in a a subset of the planar graphs.
> >
> > It's the graphs that don't divide the space into more than one region.
> >
> > It seems to me that it's appropriate to call such graphs "hierarchical
> > graphs", or simply "hierarchies". But I'm not sure. Can anyone clear this
> > up?
>
> Well, such a graph has no cycles, so it is a forest. If it's connected,
> then it's a tree.

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.

Marshall Received on Mon Jun 26 2006 - 11:31:26 CDT

Original text of this message

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