B Surendranath Reddy

Designed for undergraduate students of computer science, mathematics, and engineering, this book provides the tools and understanding needed to master graph theory and algorithms. It offers a strong theoretical foundation, detailed pseudocodes, and a range of real-world and illustrative examples to bridge the gap between abstract concepts and practical applications. Clear explanations and chapter-wise exercises support ease of comprehension for learners. The text begins with the basic properties of graphs and progresses to topics such as trees, connectivity, and distances in graphs. It also covers Eulerian and Hamiltonian graphs, matchings, planar graphs, and graph colouring. The book concludes with discussions on independent sets, the Ramsey theorem, directed graphs and networks. Concepts are introduced in a structured manner, with appropriate context and support from mathematical language and diagrams. Algorithms are explained through rules, reasoning, pseudocode, and relevant examples.

Soft set theory is new mathematical tool to deal with uncertainties arises in many social, economical etc problems which is generalization of Fuzzy set theory. Soft graph is combination of soft set theory and Classical graph theory. In this book we have discovered some important results on soft graph theory such as radius, diameter, degree of soft graph also given the tabular representation of soft graph. Further defined adjacent vertices i soft graph and developed a notion of adjacency and incidence matrix.