View Proposal #182
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 182 |
|---|---|
| First Name | Jean |
| Last Name | Clipperton |
| Institution | Simpson College |
| Speaker Category | undergraduate student |
| Title of Talk | Strong Signals: L(d,2,1)-Labeling on Simple Graphs |
| Abstract | An L(d, 2, 1)-labeling is a simplified model for the channel assignment problem. It is a natural generalization of the widely studied L(2, 1) and L(3, 2, 1)-labeling. An L(d, 2, 1)-labeling of a graph G is a function f from the vertex set V(G) to the set of positive integers such that if the distance between vertices x and y is 1, then |f (x)- f (y)| >= d; if the distance between x and y is 2, then |f (x)- f(y)| >= 2; and if the distance between x and y is 3, then |f (x)- f (y)| >= 1. The L(d, 2, 1)-labeling number k_d(G) of G is the smallest positive integer k_d such that G has an L(d, 2, 1)-labeling with k_d as the maximum label. This talk will present general results for k_d when labeling simple graphs, such as paths, bipartite graphs, and cycles. |
| Subject area(s) | Graph Theory |
| Suitable for undergraduates? | Yes |
| Day Preference | |
| Computer Needed? | |
| Bringing a laptop? | N |
| Overhead Needed? | N |
| Software requests | Power Point |
| Special Needs | |
| Date Submitted | 4/5/2007 |
| Year | 2007 |