Re: Graph theory
- From: magidin@xxxxxxxxxxxxxxxxx (Arturo Magidin)
- Date: Sat, 18 Jun 2005 22:21:47 +0000 (UTC)
In article <d9269f$qm9$1@xxxxxxxxxxxxxxxxxxxxxx>,
Brendan O'Sullivan <bos4@xxxxxxxxxxxx> wrote:
>I'm a secondary school teacher who does not have the good sense to leave
>maths alone during the holidays. I'm currently working through exercises but
>encounter difficulty, I bought Schaum's guide which helps but there are
>still things left unaswered.
>
>Could any kind soul help me with this one ?
>
>Show that if G is a simple graph with p vertives, where each vertex has
>degree >= (p-1)/2, then G must be connected. (It must be have something to
>do with how many vertices each component must have)
Exactly. Since the graph is "simple", there is at most one edge
between any two given vertices and no loops (edges starting and
finishing at the same vetex). Each connected component of G must have
at least [(p-1)/2] + 1 vertices: it has one vertex, and at least
(p-1)/2 other vertices which are the end points of the edges coming
out of that vertex. At least two components would give at least
2*([(p-1)/2] + 1) = p-1 + 2 = p+1 vertices
but the graph only has p vertices, so there cannot be more than 1
connected component. Thus, G is connected.
--
======================================================================
"It's not denial. I'm just very selective about
what I accept as reality."
--- Calvin ("Calvin and Hobbes")
======================================================================
Arturo Magidin
magidin@xxxxxxxxxxxxxxxxx
.
- Follow-Ups:
- Re: Graph theory
- From: Brendan O'Sullivan
- Re: Graph theory
- References:
- Graph theory
- From: Brendan O'Sullivan
- Graph theory
- Prev by Date: Re: Anti-humanistic mathematics was Re: Humanistic mathematics (Cantor's Theory)
- Next by Date: Re: Anti-humanistic mathematics was Re: Humanistic mathematics (Cantor's Theory)
- Previous by thread: Graph theory
- Next by thread: Re: Graph theory
- Index(es):
Relevant Pages
|