graph theory questions on convex hull and connectedness
From: Alex (sasha_pushkin99_at_hotmail.com)
Date: 01/22/04
- Next message: Willem: "Re: Mars Rover Controlled By Java"
- Previous message: Jim Nastos: "Re: Protein folding and P = NP"
- Next in thread: Marc Olschok: "Re: graph theory questions on convex hull and connectedness"
- Reply: Marc Olschok: "Re: graph theory questions on convex hull and connectedness"
- Maybe reply: Alex: "Re: graph theory questions on convex hull and connectedness"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Thu, 22 Jan 2004 22:33:58 +1100
Hi,
Apologies if my question is not that well defined... I need a few right
terms for the following constructs.
I understand that a convex hull A is defined for a set of points. Given a
graph G, a convex hull is defined for the set of the graph vertices, V(G).
Let's say all the vertices in the graph's convex hull A are removed. What do
we call the graph that remains? I mean, is there a name for X = V(G) \ A ?
Then, I need to differentiate the cases where this complement X is connected
or disconnected. Is there a specific name, say, for a disconnected graph
that remains after the removal of the convex hull?
Thanks!
A.
- Next message: Willem: "Re: Mars Rover Controlled By Java"
- Previous message: Jim Nastos: "Re: Protein folding and P = NP"
- Next in thread: Marc Olschok: "Re: graph theory questions on convex hull and connectedness"
- Reply: Marc Olschok: "Re: graph theory questions on convex hull and connectedness"
- Maybe reply: Alex: "Re: graph theory questions on convex hull and connectedness"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|