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

has been cited by the following article:

• TITLE: Felicitous Labellings of Some Network Models

  AUTHORS: Jiajuan Zhang, Bing Yao, Zhiqian Wang, Hongyu Wang, Chao Yang, Sihua Yang

  KEYWORDS: Felicitous Labelling; Set-Ordered Felicitous Labelling; Symmetric Graphs;Trees

  JOURNAL NAME: Journal of Software Engineering and Applications, Vol.6 No.3B, April 10, 2013

  ABSTRACT: Building up graph models to simulate scale-free networks is an important method since graphs have been used in researching scale-free networks. One use labelled graphs for distinguishing objects of communication and information networks. In this paper some methods are given for constructing larger felicitous graphs from smaller graphs having special felicitous labellings, and some network models are shown to be felicitous.