全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Radio Number for Total Graph of Paths

DOI: 10.1155/2013/326038

Full-Text   Cite this paper   Add to My Lib

Abstract:

A radio labeling of a graph is a function from the vertex set to the set of nonnegative integers such that , where and are diameter and distance between and in graph , respectively. The radio number of is the smallest number such that has radio labeling with . We investigate radio number for total graph of paths. 1. Introduction In a telecommunication system to design radio networks, the interference constraints between a pair of transmitters play a vital role. For the transmitters of radio network, we seek to assign channels such that the network fulfills all the interference constraints. The assignment of channels to the transmitters is popularly known as channel assignment problem which was introduced by Hale [1]. For radio network if we assume that the frequencies are uniformly distributed in the spectrum then the frequency span determines the bandwidth allocated for the assignment. In this case, the interference between two transmitters is closely related with the geographic location of the transmitters. Earlier designer of radio networks considered only the two-level interference, namely, major and minor. They classified a pair of transmitters as very close transmitters if the interference level between them is major and close transmitters if the interference level between them is minor. To solve the channel assignment problem, the interference graph is developed and assignment of channels converted into graph labeling (a graph labeling is an assignment of label to each vertex according to certain rule). In interference graph, the transmitters are represented by the vertices, and two vertices are joined by an edge if corresponding transmitters have the major interference while two transmitters have minor interference then corresponding vertices are at distance two, and there is no interference between transmitters if they are at distance three or beyond it. In other words, very close transmitters are represented by adjacent vertices, and close transmitters are represented by the vertices which are at distance two apart. In fact, Roberts [2] proposed that a pair of transmitters which has minor interference must receive different channels and a pair of transmitters which has major interference must receive channels that are at least two apart. Motivated through this problem Griggs and Yeh [3] introduced -labeling in which channels are related with the nonnegative integers. Definition 1. A distance two labeling (or -labeling) of a graph is a function from vertex set to the set of nonnegative integers such that the following conditions are

References

[1]  W. K. Hale, “Frequency assignment: theory and applications,” Proceedings of the IEEE, vol. 68, no. 12, pp. 1497–1514, 1980.
[2]  F. S. Roberts, “T-colorings of graphs: recent results and open problems,” Discrete Mathematics, vol. 93, no. 2-3, pp. 229–245, 1991.
[3]  J. R. Griggs and R. K. Yeh, “Labeling graphs with condition at distance 2,” SIAM Journal on Discrete Mathematics, vol. 5, no. 4, pp. 586–595, 1992.
[4]  R. K. Yeh, “A survey on labeling graphs with a condition at distance two,” Discrete Mathematics, vol. 306, no. 12, pp. 1217–1231, 2006.
[5]  D. Sakai, “Labeling chordal graphs: distance two condition,” SIAM Journal on Discrete Mathematics, vol. 7, no. 1, pp. 133–140, 1994.
[6]  G. J. Chang and D. Kuo, “The L(2, 1)-labeling problem on graphs,” SIAM Journal on Discrete Mathematics, vol. 9, no. 2, pp. 309–316, 1996.
[7]  S. K. Vaidya, P. L. Vihol, N. A. Dani, and D. D. Bantva, “L(2, 1)-labeling in the context of some graph operations,” Journal of Mathematics Research, vol. 2, no. 3, pp. 109–119, 2010.
[8]  S. K. Vaidya and D. D. Bantva, “Labeling cacti with a condition at distance two,” Le Matematiche, vol. 66, pp. 29–36, 2011.
[9]  G. Chartrand, D. Erwinn, F. Harary, and P. Zhang, “Radio labeling of graphs,” Bulletin of the Institute of Combinatorics and Its Applications, vol. 33, pp. 77–85, 2001.
[10]  D. Liu and X. Zhu, “Multilevel distance labelings for paths and cycles,” SIAM Journal on Discrete Mathematics, vol. 19, no. 3, pp. 610–621, 2005.
[11]  D. Liu and M. Xie, “Radio number of square cycles,” Congressus Numerantium, vol. 169, pp. 105–125, 2004.
[12]  D. Liu and M. Xie, “Radio number for square paths,” Ars Combinatoria, vol. 90, pp. 307–319, 2009.
[13]  D. Der-Fen Liu, “Radio number for trees,” Discrete Mathematics, vol. 308, no. 7, pp. 1153–1164, 2008.
[14]  D. B. West, Introduction To Graph Theory, Prentice-Hall of India, 2001.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133