GRAPH COLORINGS APPLIED IN SCALE-FREE NETWORKS

DOI

10.2991/iccsee.2013.749How to use a DOI?

Keywords

scale-free networks, nodes, links, models, vertex distinguishing total colorings

Abstract

Building up graph models to simulate scale-free networks is an important method since graphs have been used in researching scale-free networks and communication networks, such as graph colorings can be used for distinguishing objects of communication and information networks. In this paper we determine the avdtc chromatic numbers of some models related with researching networks.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Chao Yang
AU  - Bing Yao
AU  - Hongyu Wang
AU  - Xiang'en Chen
AU  - Sihua Yang
PY  - 2013/03
DA  - 2013/03
TI  - GRAPH COLORINGS APPLIED IN SCALE-FREE NETWORKS
BT  - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
PB  - Atlantis Press
SP  - 3110
EP  - 3113
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccsee.2013.749
DO  - 10.2991/iccsee.2013.749
ID  - Yang2013/03
ER  -