科研之友
微信
新浪微博
Facebook
分享链接
摘要
The L(p, q)-labeling problem arises from the optimization problem of channel assignment in a radio network. For two non-negative integers p and q, an L(p, q)-labeling f of a graph G is an assignment of non-negative integers to the vertices of G such that adjacent vertices get labels which are at least p apart, and vertices at distance two get labels which are at least q apart. The L(p, q) span of G is the minimum range of labels over all L(p, q)-labelings of G. In this article, we completely determine the L(1, 1) and L(2, 1) spans of (n - 2)-regular bipartite graphs with 2n vertices.
