The ANRF-sponsored two-day National Seminar on “Mathematical Structure, Algorithm and Extremal Aspects of Resolving Sets in Sparse Graphs,” held on 16–17 March 2026 at the First Year Seminar Hall, ESEC, was successfully coordinated by Dr. S. Senthilvelavan (Director/First Year) and Ms. N. S. Rani Selvanayage (AP/Mathematics). The event brought together researchers, academicians, and students to explore recent advancements in graph theory and its practical applications. It significantly enhanced participants’ understanding of resolving sets, metric dimension, and extremal properties in sparse graphs, while emphasizing efficient algorithmic approaches for solving real-world problems. Through expert lectures, paper presentations, and interactive discussions, the seminar fostered knowledge exchange, encouraged collaborative research, and inspired innovative directions in soft computing and combinatorial optimization. Overall, the seminar made a valuable contribution to strengthening research capabilities and deepening insights into modern mathematical and computational techniques.