G.S. Bloom and S.W. Golomb, “Applications of numbered undirected graphs,” Proc. IEEE, 65 (1977) 562-570. doi:10.1109/PROC.1977.10517

has been cited by the following article:

• TITLE: Induced Total Labellings of Models as Scale-free Networks

  AUTHORS: Bing Yao, Jiajuan Zhang, Xiangqian Zhou, Xiang’en Chen, Xiaomin Zhang, Ming Yao, Mogang Li

  KEYWORDS: Bioinformatics; Network; Graph Labeling; Chromatic Numbers

  JOURNAL NAME: Communications and Network, Vol.5 No.3C, November 7, 2013

  ABSTRACT: A recently discovered approach including de Brujin graphs and Eulerian circuits are used to DNA sequencing and fragment assembly, and to simplify DNA graphs through a series of transformations on graphs and digraphs in the field of bioinformatics. Since numbered graphs provide underlying mathematical models in studying the wide variety of seemingly unrelated practical applications, so graph colorings often are used to divide large systems into subsystems. A new graph labeling has been introduced and investigated.