Name of Institution |
Programme |
B.B.I.T, V.V. NAGAR |
Strategic Planning, Management & Implementation In Technical Education |
NITTTR, Extension Centre, Ahmedabad |
Induction training program for Engg. College Teachers(QIP) |
IIT, Bombay |
Univariate and Multivariate Calculus |
NITTTR, Chandigrah |
Technical Institutions and Skill Development for thea Masses |
IIT, Bombay |
Linear Algebra and Differential Equations |
IIT, Bombay |
Differential Equations-II and Complex Analysis |
M. G. Science college, Ahmedabad |
Solving mathematical Problems by Software |
L.D. College of Engineering, Ahmedabad |
Mission 10X Workshop |
Gujarat Technological University, Ahmedabad |
Project Demonstration on Differential equations |
Department of Applied Mathematics & Humanities, SVNIT, Surat |
Partial Differential Equations and Their Applications |
Gujarat Technological University, Ahmedabad |
Visualization of Calculus |
Gujarat Technological University, Ahmedabad |
Pedagogy Sessions in Calculus |
Gujarat Technological University, Ahmedabad |
Patent Search Methodology |
NITTTR Extension Centre, Ahmedabad |
Induction Training Programme Phase-I |
L. D. College of Engineering, Ahmedabad |
Fluid Dynamics |
Swaminararayan Dham, Gandhinagar |
Karmayogi Talim |
Reva Institute of Technology & Management, Bangalore |
Pre Conference Workshop on Semigraphs |
SPIPA, Gandhinagar |
Special Program for Commissioner Technical Education |
IIT, Roorkee |
Dynamical Systems and Control |
L. D. College of Engineeriong, Ahmedabad |
Mathematical Analysis for Engineering |
Shantilal Shah Engineering College, Bhavnagar |
iFDP- International Faculty Development Program |
NITTTR Extension Centre, Ahmedabad |
Research Method and Academic Writing |
Head of General Department
NIL
¨ Consecutive Adjacent Domination Number in Semigraphs
¨ Vertex Covering and Independence in Semigraph
- Strong independence and strong vertex covering in semigraphs
¨ Clique Covering in a Graphs
¨ s – Domination in Semigraphs
¨ Irredundancy in Graphs and Vertex Transitivity
¨ Upper Vertex Covering Number of a Graph
¨ Maximum Independent Sets and Well Covered Graphs
<!--[if gte mso 9]><xml>NIL
NIL
Life Member, Academy of Discrete Mathematics and its Applications (ADMA)
NIL