Induced Total Labellings of Models as Scale-free Networks
Author(s) -
Bing Yao,
Jiajuan Zhang,
Xiangqian Zhou,
Chen Xiang-en,
Xiaomin Zhang,
Ming Yao,
LI Mo-gang
Publication year - 2013
Publication title -
communications and network
Language(s) - English
Resource type - Journals
eISSN - 1949-2421
pISSN - 1947-3826
DOI - 10.4236/cn.2013.53b2013
Subject(s) - computer science , eulerian path , theoretical computer science , graph , mathematics , lagrangian , mathematical physics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom