Abstract
In graph theory, generation of random graphs finds a wide range of applications in different scheduling problems, approximation algorithms, problems involving modeling and simulation, different database applications, and obviously to test the performance of any algorithm. The algorithm, which has been devised in this paper, is mainly for the purpose of providing test bed for checking performance of other algorithms. It generates different non-isomorphic graph instances of a given order and having unique number of edges. The number of such instances possible for a graph of given order has also been subsequently formulated. Different such graph instances of different orders, generated in a uniform computing environment, and the computing time required for such generations have also been included in this paper. The simplicity and efficiency of the algorithm, subsequently proved in the paper, give us a new insight in the area of random graph generation and have called for further research scope in the domain.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. First Edition. Pearson (1983)
Bayati, M., Kim, J.H., Saberi, A.: A sequential algorithm for generating random graphs. Algorithmica (Springer) 58(4), 860–910 (2010)
Bhuiyan, H., Khan, M., Marathe, M.: A parallel algorithm for generating a random graph with a prescribed degree sequence. In: arXiv preprint: 1708.07290 (2017)
Cordeiro, D., Mounie, G., Perarnau, S., Trystram, D., Vincent, J.M., Wagner, F.: Random graph generation for scheduling simulations. In: Proceedings of Third International Conference on Simulation Tools and Techniques (SIMUTools’10), Article No. 60 (2010)
Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Prentice Hall of India Pvt. Ltd., New Delhi (2003)
Erdos, P., Renyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17–61 (1960)
Horn, M.V., Richter, A., Lopez, D.: A random graph generator. In: Proceedings of 36th Annual Midwest Instruction and Computing Symposium, Duluth, Minnesota (2003)
Horowitz, E., Sahni, S., Anderson, S.: Fundamentals of Data Structures in C, 2nd edn. Universities Press Pvt. Ltd., Hyderabad, India (2008)
Nobari, S., Lu, X., Karras, P., Bressan, S.: Fast random graph generation. In: Proceedings of the 14th International Conference on Extending Database Technology, Uppsala, Sweden, pp. 331–342 (2011). https://doi.org/10.1145/1951365.1951406
Viger, F., Latapy, M.: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In: Computing and Combinatorics, COCOON 2005. Lecture Notes in Computer Science (Springer, Berlin, Heidelberg) 3595, pp. 440–449 (2005). https://doi.org/10.1007/11533719_4
Viger, F., Latapy, M.: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. J. Complex Netw. 4(1), 15–37 (2016)
Wang, C., Lizardo, O., Hachen, D.: Algorithms for generating large-scale clustered random graphs. Network Sci. 2, 403–415 (2014)
Weisstein, E.W.: (IG) isomorphic graphs. In: MathWorld—A Wolfram Web Resource. http://mathworld.wolfram.com/IsomorphicGraphs.html. Accessed 18 Jan 2019
Weisstein, E.W.: (RG) random graph. In: MathWorld—A Wolfram Web Resource. http://math-world.wolfram.com/RandomGraph.html. Accessed 18 Jan 2019
Wikipedia (ST) Spanning Tree. https://en.wikipedia.org/wiki/Spanning_tree. Accessed 18 Jan 2019
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Chakraborty, M., Chowdhury, S., Pal, R.K. (2020). Generation of Simple, Connected, Non-isomorphic Random Graphs. In: Chaki, R., Cortesi, A., Saeed, K., Chaki, N. (eds) Advanced Computing and Systems for Security. Advances in Intelligent Systems and Computing, vol 995. Springer, Singapore. https://doi.org/10.1007/978-981-13-8962-7_6
Download citation
DOI: https://doi.org/10.1007/978-981-13-8962-7_6
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-8961-0
Online ISBN: 978-981-13-8962-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)