Re: A graph theory problem

From: israel@xxxxxxxxxxx (Robert Israel)
Date: 3 Jun 2005 23:40:31 GMT

In article <IHJ1r3.CI@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
Aldar Chan <I_love_Nora@xxxxxxxxxxxxxxxxxx> wrote:
>Hi, I got the following edge labeling problem. Help is greatly
>appreciated.

>Given a graph G, label its edges E(G) with 1,2,3,..... so that
>each vertex in V(G) has atmost k labels. Find a labeling
>method which achieve the minimum number of labels. If this
>problem hard?

You can't have described the problem correctly. Perhaps you meant
"at least" rather than "at most"?

Robert Israel israel@xxxxxxxxxxx
Department of Mathematics http://www.math.ubc.ca/~israel
University of British Columbia Vancouver, BC, Canada

.

Follow-Ups:
- Re: A graph theory problem
  - From: Aldar C-F. Chan
- Re: A graph theory problem
  - From: Aldar C-F. Chan

References:
- A graph theory problem
  - From: Aldar Chan

Prev by Date: Re: Cantor and the binary tree
Next by Date: Re: integral of the reciprocal of a polynomial????
Previous by thread: A graph theory problem
Next by thread: Re: A graph theory problem
Index(es):
- Date
- Thread

Relevant Pages

A graph theory problem
... I got the following edge labeling problem. ... each vertex in Vhas atmost k labels. ... method which achieve the minimum number of labels. ... Prev by Date: ...
(sci.math)
Re: A graph theory problem
... I got the following edge labeling problem. ... >>each vertex in Vhas atmost k labels. ... >>method which achieve the minimum number of labels. ... let Nbe the number of repetitions of the label l_i. ...
(sci.math)