C. K. Suja, De Paul Institute of Science & Technology, Angamaly, Kochi, Kerala, India.
C. V. R Hari Narayanan, Govt.Arts College, Paramakudi, Madurai, Tamilnadu, India.
DOI : 01.0401/ijaict.2015.11.10
International Journal of Advanced Information and Communication Technology
Received On : February 07, 2018
Revised On : March 23, 2018
Accepted On : April 15, 2018
Published On : May 05, 2018
Volume 05, Issue 05
Pages : 855-858
Abstract
Structure of massive graphs are highly Complex in nature. A complex network with non-trivial topological features often occurs in modeling real systems. Networks like World-Wide web, internet, Science collaboration graph, Cellular networks etc which are evolutionary and dynamic in nature. A common property of such large networks is that the vertex connections follow a scale free power law distribution. The scale-free nature of the link distributions indicates that collective phenomena play a vital role in the development of such networks. Here we illustrate different modeling approaches of such random graphs and its properties to analyze networks.
Keywords
Scale Free Network, Random Graph, Small World Property, Preferential Attachment, Clustering Coefficient.
Cite this article
C. K. Suja, C. V. R Hari Narayanan, “Structure and Topology of Massive Graphs” INTERNATIONAL JOURNAL OF ADVANCED INFORMATION AND COMMUNICATION TECHNOLOGY, pp.859-861, May 05, 2018.
Copyright
© 2018 C. K. Suja, C. V. R Hari Narayanan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.