
I work in linear-algebraic graph theory and combinatorics. Trees are where I spend most of my time. Currently I am working on different types of distance matrices of graphs — the distance matrix arising from the Steiner tree problem, matrices built from Buneman's four point condition, and other families of the same kind. Before joining IIT Kharagpur I was a postdoctoral fellow at IIT Bombay, and I earned my PhD at IIT Guwahati under Prof. Sukanta Pati.
Email reaches me fastest; you will also find me at the office address below.
Linear-Algebraic Graph Theory
Department of Mathematics, IIT Guwahati, Assam, India
My thesis studied distance-type matrices of trees — in particular the bipartite distance and bipartite Laplacian matrices of a nonsingular tree — and the combinatorial identities that describe their inverses.
Mathematics and Computing
Department of Mathematics, IIT Guwahati, Assam, India
Mathematics (Honours)
Midnapore College, Vidyasagar University, West Bengal, India
Department of Mathematics, IIT Kharagpur
Department of Mathematics, IIT Bombay
IIT Guwahati
Department of Mathematics, IIT Guwahati
Departmental Postgraduate Programme Committee (DPPC), Department of Mathematics, IIT Guwahati.
I spend my free time by learning various programming languages.
Coursework from my postgraduate years at IIT Guwahati, grouped by area.
Real Analysis
Functional Analysis
Operator Theory
Complex Analysis
Topology
Algebraic Topology
Linear Algebra
Advanced Linear Algebra
Modern Algebra
Numerical Analysis
Numerical Linear Algebra
Optimization Techniques
Differential Equations
Numerics of Partial Differential Equations
Probability Theory
Mathematics of Financial Derivatives
Advanced Graph Theory
Discrete Mathematics
Data Structures & Algorithms
Theory of Computation
Computer Programming