Ambat Vijayakumar – författare

The Shrikhande graph, discovered by Indian Mathematician Sharadchandra Shankar Shrikhande in 1959, exhibits several unusual properties and occupies a pivotal position within discrete mathematics. Offering a unique introduction to graph theory and discrete mathematics, this book uses the example of the Shrikhande graph as a window through which these topics can be explored. Providing historical background, including the Euler conjecture and its demise, the authors explore key concepts including: Cayley graphs; topological graph theory; spectral theory; Latin squares; root systems. A novel and valuable resource for graduate students and researchers interested in graph theory, its history, and applications, this book offers a comprehensive exploration of the Shrikhande graph and its significance.

The Shrikhande graph, discovered by Indian Mathematician Sharadchandra Shankar Shrikhande in 1959, exhibits several unusual properties and occupies a pivotal position within discrete mathematics. Offering a unique introduction to graph theory and discrete mathematics, this book uses the example of the Shrikhande graph as a window through which these topics can be explored. Providing historical background, including the Euler conjecture and its demise, the authors explore key concepts including: Cayley graphs; topological graph theory; spectral theory; Latin squares; root systems. A novel and valuable resource for graduate students and researchers interested in graph theory, its history, and applications, this book offers a comprehensive exploration of the Shrikhande graph and its significance.

This book constitutes the proceedings of the 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019, held in Kharagpur, India, in February 2019.The 22 papers presented together with 3 invited papers in this volume were carefully reviewed and selected from 86 submissions.The conference had papers in the areas of algorithms, graph theory, combinatorics, computational geometry, discrete geometry, and computational complexity.