JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2016, Vol. 51 ›› Issue (4): 79-85.doi: 10.6040/j.issn.1671-9352.0.2014.404

Previous Articles     Next Articles

An algorithm and its implementation for odd-elegant labeling of general sun graph Sm,n

XIE Jian-min1, YAO Bing2*, ZHAO Ting-gang1   

  1. 1. College of Mathematics, Lanzhou City University, Lanzhou 730070, Gansu, China;
    2. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, Gansu, China
  • Received:2014-09-10 Online:2016-04-20 Published:2016-04-08

PDF (PC)

998

Abstract: The definition of the general sun graph Sm,n is given, and an algorithm of the odd-elegant labeling of the graphs is obtained.The correctness of the algorithm has been proven, so does the odd-elegant feature of the graph Sm,n. Finally, the program is compiled, and through the experimental data show the effectiveness of the algorithm.

Key words: odd-elegant feature, odd-elegant labeling algorithm, general sun graph Sm,n, odd-elegant labeling, effectiveness of the algorithm

CLC Number: 

  • TP301.6
[1] ROSA A. On certain valuations of the vertices of a graph[M] // Theory of Graphs(International Symposium, Rome, July, 1966). New York: Gordon and Breach, 1967:349-355.
[2] CHANG G J, HSU D F, ROGERS D G. Additive variations on a graceful theme: some results on harmonious and other related graphs[J]. Congr Numer, 1981, 32:181-197.
[3] ZHOU Xiangqian, YAO Bing, CHEN Xiangeng. Every lobster is odd-elegant[J]. Information Processing Letters, 2013, 113(1-2):30-33.
[4] GALLIAN J A. A dynamic survey of graph labeling[J]. The Electronic journal of Combinatorics, 2013, 12:66-68.
[5] GAO Zhenbing. The labelings of a variation of banana trees[J]. Ars Combin, 2010, 24:175-181.
[6] YOUSSEF M Z. On Ek-cordial labeling[J]. Ars Combin, 2012, 26:271-279.
[7] ZHOU Xiangqian, YAO Bing, CHEN Xiangeng, et al. A proof to the odd-gracefulness of all lobsters[J]. Ars Combin, 2012, 103:13-18.
[8] YOUSSEF M Z.On k-equitable and k-balanced labeling of graphs[J]. Ars Combin, 2013, 108:51-64.
[9] 李亚琴, 李金祥, 梁颖红. 基于图像特征和霍夫曼编码的图像水印算法[J].计算机应用与软件, 2013, 30(9):128-130. LI Yaqin, LI Jinxiang, LIANG Yinghong. Image watermarking algorithm based on image characteristics and Huffman coding[J]. Computer Applications and Software, 2013, 30(9):128-130.
[10] 王勇, 李程俊, 颜宪斌. 栅格数据空间分析中最短距离并行算法的研究[J].计算机应用与软件, 2013, 30(8):14-17. WANG Yong, LI Chengjun, YAN Xianbin. Research on parallel algorithm of shortest distance in raster data spatial analysis[J]. Computer Applications and Software, 2013, 30(8):14-17.
[11] 唐保祥, 任韩. 优美图所有优美标号的生成算法[J].天津师范大学学报, 2010, 30(4):5-8. TANG Baoxiang, REN Han. Generating algorithm for all graceful labeling of graceful graph[J]. Journal of Tianjin Normal University, 2010, 30(4):5-8.
[12] BONDY J A, MURTY U S R. Graph theory with applications[M]. New York: Elsevier, 1976, 28(419):237-238.
[1] . Graph model based trustworthy resource scheduling algorithm in cloud environment [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(1): 63-74.
[2] ZHANG Chun-ying, WANG Li-ya, LIU Bao-xiang. Dynamic reduction theory for interval concept lattice based on covering and its realization [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2014, 49(08): 15-21.
[3] ZHENG Xiang-Wei,LIU Hong . A diversity-guided two stages multi-objective particle swarm optimizer [J]. J4, 2008, 43(11): 5-10 .
[4] SONG Le-hui,CHENG Yue-gui,PAN Meng . A hybrid evolutionary modeling algorithm for dynamic systems [J]. J4, 2008, 43(11): 27-30 .
[5] YUAN Xiao-hang,DU Xiao-yong . iRIPPER: an improved rule-based text categorization algorithm [J]. J4, 2007, 42(11): 66-68 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd