[ 1 ] GNANAJOTHI R B. Topics in graph theory[D]. Madurai: Madurai Lamaraj University, 1991.
[ 2 ] WEI L X, ZHANG K L. The graceful graphs on several kinds of union graphs[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 2008, 47(3): 10-13.
[ 3 ] WANG T, LIU H S, LI D M. Gracefulness of the graphs related to wheel[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni 2011, 50(6): 16-19.
[ 4 ] YAO B, YANG C, YAO M, et al. Graphs as models of scale-free networks[J]. Applied Mechanics and Materials, 2013, 380/381/382/383/384: 2034-2037.
[ 5 ] YANG S H, YAO B, YAO M, et al. Labeling sun-like graphs from scale-free small-world network models[ C]//Proceedings of the 6th International Conference on Measuring Technology and Mechatronics Automation. IEEE, 2014: 378-384.
[ 6 ] GALLIAN J A. A dynamic survey of graph labeling[J/OL]. The Electronic Journal of Combinatorics,2011[ 2015-04-01].http://www. emis. ains. org/journals/EJC/surveys/ds6. pdf.
[ 7 ] ZHOU X Q, YAO B, CHEN X E. Every lobster is odd-elegant[J]. Information Processing Letters, 2013,113(1/2):30-33.
[ 8 ] ZHOU X Q, YAO B, CHEN X E, et al. A proof to the odd-gracefulness of all lobsters[J]. Ars Combinatoria, 2012, 103: 13-18.
[ 9 ] ROSA A. On certain valuation of the vertices of a graph[M]//Theory of Graphs, New York: Gordon and Breach, 1967:349-355.
[10] BONDY A J, MURTY U S R. Graph Theory with Applications[M]. London :The MaCmillan Press Ltd, 1976.
[11] 郭璟霞，姚兵，张家娟.关于边对称树的广义优美性[J].西南大学学报（自然科学版），2013, 35(2):62-68.