Edge-Magic Total Labellings of some Network Models

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.

[1]  A. Kotzig,et al.  Magic Valuations of Finite Graphs , 1970, Canadian Mathematical Bulletin.

[2]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[3]  G.S. Bloom,et al.  Applications of numbered undirected graphs , 1977, Proceedings of the IEEE.

[4]  Solomon W. Golomb,et al.  Numbered complete graphs, unusual rulers, and assorted applications , 1978 .

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  Frank Harary,et al.  Topics in graph theory , 1979 .

[7]  N. J. A. Sloane,et al.  On Additive Bases and Harmonious Graphs , 1980, SIAM J. Algebraic Discret. Methods.

[8]  W. Wallis,et al.  Magic Graphs , 2001 .

[9]  Ramón M. Figueroa-Centeno,et al.  On Super Edge-Magic Graphs , 2002, Ars Comb..

[10]  Mirka Miller,et al.  Vertex-antimagic total labelings of graphs , 2003, Discuss. Math. Graph Theory.

[11]  S. M. Hegde,et al.  On magic graphs , 2003, Australas. J Comb..

[12]  Walter Willinger,et al.  Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications , 2005, Internet Math..

[13]  Joseph A. Gallian,et al.  A Dynamic Survey of Graph Labeling , 2009, The Electronic Journal of Combinatorics.

[14]  Bing Yao,et al.  A Note on Strongly Graceful Trees , 2009, Ars Comb..

[15]  Xiangqian Zhou,et al.  A proof to the odd-gracefulness of all lobsters , 2012, Ars Comb..

[16]  Bing Yao,et al.  Labellings and invariants of models from complex networks , 2012, 2012 International Conference on Systems and Informatics (ICSAI2012).

[17]  L. Gladkov.  Topics in graph theory , 2018, AMS/MAA Textbooks.