Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Applied Mathematics

2012

1)-labeling

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

The Minimum Span Of L(2,1)-Labelings Of Certain Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Matthew Tesch, Denise Troxell, Cody Wheeland Jul 2012

The Minimum Span Of L(2,1)-Labelings Of Certain Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Matthew Tesch, Denise Troxell, Cody Wheeland

Sarah Spence Adams

In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph G to the non-negative integers such that |f(x)–f(y)|≥ 2 if xand y are adjacent vertices and |f(x)–f(y)|≥1 if xand y are at distance two. The goal is to …


An Extension Of The Channel-Assignment Problem: L(2, 1)-Labelings Of Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Denise Troxell Jul 2012

An Extension Of The Channel-Assignment Problem: L(2, 1)-Labelings Of Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Denise Troxell

Sarah Spence Adams

The channel-assignment problem involves assigning frequencies represented by nonnegative integers to radio transmitters such that transmitters in close proximity receive frequencies that are sufficiently far apart to avoid interference. In one of its variations, the problem is commonly quantified as follows: transmitters separated bythe smallest unit distance must be assigned frequencies that are at least two apart and transmitters separated by twice the smallest unit distance must be assigned frequencies that are at least one apart. Naturally, thischannel-assignment problem can be modeled with vertex labelings of graphs. An L(2, 1)-labeling of a graph G is a function f from the …