Edge-Magic Total Labellings of Some Network Models
Authors
Hongyu Wang, Bing Yao, Chao Yang, Sihua Yang, Xiang’en Chen, Ming Yao, Zhenxue Zhao
Corresponding Author
Hongyu Wang
Available Online February 2013.
- DOI
- 10.2991/isccca.2013.122How to use a DOI?
- Keywords
- network, tree, set-ordered labellings, edge-magic total labelling, edge-symmetric graphs
- Abstract
It has been known that edge-symmetric graphs can be used as models of some scale-free networks, such as hierarchial networks and self-similar networks, such as graph colorings can be used for distinguishing objects of communication and informa-tion networks. We study the edge-magic property of edge-symmetric graphs, and construct graphs having edge-magic total labellings from smaller graphs.
- 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/).
Cite this article
TY - CONF AU - Hongyu Wang AU - Bing Yao AU - Chao Yang AU - Sihua Yang AU - Xiang’en Chen AU - Ming Yao AU - Zhenxue Zhao PY - 2013/02 DA - 2013/02 TI - Edge-Magic Total Labellings of Some Network Models BT - Proceedings of the 2nd International Symposium on Computer, Communication, Control and Automation (ISCCCA 2013) PB - Atlantis Press SP - 491 EP - 494 SN - 1951-6851 UR - https://doi.org/10.2991/isccca.2013.122 DO - 10.2991/isccca.2013.122 ID - Wang2013/02 ER -