Labelling Properties of Models Related with Complex Networks Based on Constructible Structures

Abstract:

Network structure is irregular, complex and dynamically evolving in time. In the Internet of Things, we are Things. Labelled graphs are used in researching areas of many networks, cryptography, computer science, biology, information etc. For simulating real networks we construct compound split-graphs and compound split-trees having particular labellings almost in arbitrary manners by our methods. We have several algorithms in polynomial time.

• Periodical: Advanced Materials Research (Volumes 765-767)
• Pages: 1118-1123
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.765-767.1118
• Online since: September 2013
• Authors: Hong Yu Wang, Bing Yao, Chao Yang, Si Hua Yang, Xiang En Chen
• Keywords: Algorithm (GA), Graph Colorings, Graph Labellings, Graph Models, Network

References

[1] J. A. Bondy, U.S.R. Murty. Graph Theory with Applications. The MaCmillan Press ltd, London and Basingstoke, New York, (1976).

[2] S. Boccaletti, V. Latora, Y. Moreno, M. Chavez , D. -U. Hwang. Complex networks: Structure and dynamics. Physics Reports 424 (2006) 175-30.

DOI: 10.1016/j.physrep.2005.10.009

[3] G.S. Bloom and S.W. Golomb, Applications of numbered undirected graphs, Proc. IEEE 65 (1977), 562-570.

DOI: 10.1109/proc.1977.10517

[4] G.S. Bloom and S.W. Golomb, Numbered complete graphs, unusual rules, and assorted applications, In: Theory and Applications of Graphs, Lecture Notes in Math. 642 (1978), 53-65.

DOI: 10.1007/bfb0070364

[5] M. Baca, F. Bertault, J. MacDougall, M. Miller, R. Simanjuntak, and Slamin, Vertex-antimagic total labelings of graphs, Discuss. Math. Graph Theory, 23 (2003)67-83.

DOI: 10.7151/dmgt.1186

[6] Jogen Bang-Jensen and Gregory Gutin. Digraphs Theory, Algorithms and Applications. Springer-Verlag. Berlin Heidelberg, New York, London, Paris, Tokyo, Hong Kong, Barcelona, Budapest, August (2007).

DOI: 10.1002/abio.370140108

[7] H. Enomoto, A. S. Llado, T. Nakamigawa, and G. Ringel. Super edge-magic graphs. SUT J. Math., 34 (1998), 105-109.

DOI: 10.55937/sut/991985322

[8] Joseph A. Gallian. A Dynamic Survey of Graph Labelling. The Electronic Journal of Combinatorics, 14 (2009), #DS6.

[9] R.B. Gnanajothi. Topics in Graph Theory. Ph. D. Thesis, Madurai Kamaraj University, (1991).

[10] A. Kotzig and A. Rosa, Magic valuations of finite graphs, Canad. Math. Bull, 13 (1970), 451-461.

DOI: 10.4153/cmb-1970-084-1

[11] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs, Internat. Symposium, Rome, July 1966, Gordon and Breach, N.Y. and Dunod Paris (1967), 349-355.

[12] B.M. Stewart, Magic graphs, Can. J. Math. 18 (1966), 1031-1056.

[13] Bing Yao, Hui Cheng, Ming Yao, Meimei Zhao. A Note on Strongly Graceful Trees. Ars Combinatoria 92 (2009), 155-169.

[14] Bing Yao, Xiangqian Zhou, Jiajuan Zhang, Xiang'en Chen, Xiaomin Zhang, Jianming Xie, Ming Yao, Mogang Li. Labellings And Invariants Of Models From Complex Networks. Proceeding of 2012 International Conference on Systems and Informatics, Yantai, China 2012: 1616-1620. IEEE catalog number: CFP1273R-CDR.

DOI: 10.1109/icsai.2012.6223350

[15] Xiangqian Zhou, Bing Yao, Xiang'en Chen, Haixia Tao. A proof to the odd-gracefulness of all lobsters. Ars Combinatoria 103 (2012), 13-18.

[16] Xiangqian Zhou, Bing Yao, Xiangen Chen. On Odd-gracefulness of All Symmetric Trees. to appear in JCMCC.