(School of SHM, Dr. RVR NRI Institute of Technology Deemed to be University)
M. S. V. D. Sudarsan is an Associate Professor in the Department of Mathematics, School of SHM, Dr. RVR NRI Institute of Technology Deemed to be University, Andhra Pradesh, India. His research interests include graph theory, optimization, applied mathematics, and curriculum design methodologies.
M. S. V. D. Sudarsan, Vijay Kumar Dwivedi. In: AIoT and Cloud-Based Smart Education Systems: Intelligent Campus Management and Learning Analytics — ISBN: 978-81-69372-12-1. Pages: 316 - 339
The growing intricacy of contemporary education necessitates methodical and data-informed strategies for curriculum development and syllabus enhancement. This chapter examines the utilisation of Graph Theory as a robust mathematical framework for modelling, analysing, and optimising academic programs. Graph-based models facilitate structured visualisation of prerequisite links, knowledge flow, and competency development paths by expressing courses, topics, and learning dependencies as nodes and edges. The chapter examines essential graph theory concepts, including directed graphs, weighted graphs, topological sorting, shortest path algorithms, and network centrality metrics for curriculum optimisation. It offers a framework for automated syllabus creation that combines graph-based representations with optimisation methods to guarantee logical sequencing, equitable workload allocation, and alignment with learning objectives. Applications in adaptive curriculum planning, transdisciplinary course design, and personalised learning trajectories are emphasised. Furthermore, difficulties including data modelling complexity, scalability, and interaction with current educational systems are rigorously analysed. Emerging themes such as AI-assisted curriculum design, dynamic syllabus adaption, and knowledge graph integration are examined. This chapter illustrates how graph theory can markedly improve curricular efficiency, coherence, and adaptability to changing educational requirements.
