Allurement of Some Graph Algorithms

The last five decades have witnessed an upsurge of interest and activity in graph theory, particularly among mathematicians and engineers. It has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, computer science, networking, mobile computing, sociology and many other fields. This book is devoted entirely to computational aspects of graph theory, including graph-theoretic algorithms. The book provide some new algorithms of graph theory such as generation all spanning trees, minimal spanning tree generation, graph colouring algorithm, importance of some special graphs in networking, hiding information and applications of graphs in different areas. The book is useful for graduate and post graduate students of science and engineering and new research scholar to motivate them in the field of graph theory.

Autorentext

Sanjay Kumar Pal: Completed BSc, LME, MCA, M.Tech. and pursuing PhD(CS). He has more than 20 years of experience having 35 International and National research publications in Graph Theory and Network Topology Design. Samar Sen Sarma: Completed M.Tech. and Ph.D-CS from University of Calcutta having more than 35 yrs experience about 100 publications.