Research on Information Process with a Computational Approach to Some Odd-Graceful Trees

Abstract:

Graph labeling theory has important applications in coding theory, communication networks, logistics and other aspects. In Operations Research or Systems Engineering Theory and Methods, one very often use graph colorings/labellings to divide large systems into subsystems. One can use colorings/labellings to distinguish vertices and edges between vertices in order to find fast algorithms to imitate some effective transmissions and communications in information networks. In this paper we present a computational approach to the odd-graceful labelings for some olive trees.

• Periodical: Advanced Materials Research (Volume 1022)
• Pages: 207-210
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.1022.207
• Online since: August 2014
• Authors: Jian Min Xie, Bing Yao*, Ming Yao, Xiang En Chen
• Keywords: Odd-Graceful, Odd-Graceful Labelling, Olive Trees, Tree

References

[1] S.W. Golomb. How to number a graph. Graph Theory and Computing, ed. By R. C. Read}, Academic Press, New York (1972) 23-37.

[2] J.A. Gallian, A dynamic survey of graph labeling, The Electronic journal of Combinatorics, 18(2011), #DS6.

[3] Xiangqian Zhou, Bing Yao, Xiang'en Chen and Haixia Tao. A proof to the odd-gracefulness of all lobsters. Ars Combinatoria 103 (2012) 13-18.

[4] Xiangqian Zhou, Bing Yao, Xiang'en Chen. Every Lobster Is Odd-elegant. Information Processing Letters 113 (2013) 30-33.

DOI: 10.1016/j.ipl.2012.09.008

[5] Xiangqian Zhou, Bing Yao, Xiang'en Chen. On Odd-gracefulness of All Symmetric Trees. JCMCC 87(2013) 309-319.