Announcements
Photo of Prof. Narayanan N

Prof. Narayanan N

Faculty - School of Engg. & Science

naru@iitmz.ac.in

website

Educational Qualifications

Ph.D. 2010

Mathematics

Homi Bhabha National institute

M.Sc. 1999

Operations Research and Computer Applications

Cochin University of Science and Technology

B.Sc. 1997

Mathematics

University of Calicut

Research Interests

My interest areas include Structural Graph Theory: Colouring, Decomposition. Algebraic Combinatorics: Graph Ideals and Comb. Algebra.

Relevant Courses Taught

  • Calculus I, Calculus II, Series and Matrices, Linear Algebra and Numerical Analysis, Linear Algebra for Engineers, Discrete Mathematics, Graphs and Combinatorics, Basic Graph Theory (B.Tech.)
  • Mathematical Logic, Graph Theory, Combinatorics, Fundamentals of Discrete Mathe- matics (M.Sc.)
  • Discrete Mathematics (M.Tech)
  • Combinatorics (NPTEL)

Selected Papers

2022

On total coloring of some classes of regular graphs

Shantharam Prajnanaswaroopa

Jayabalan Geetha

Kanagasabapathi Somasundaram

Hung-Lin Fu

Narayanan Narayanan

Taiwanese J. Math., 26 (4), 667-683

2022

Strong edge coloring of cayley graphs and some product graphs

Suresh Dara

Suchismita Mishra

Narayanan Narayanan

Zsolt Tuza

Graphs Combin. 38, no. 2, Paper No. 51, 20 pp.

2022

Extending some results on the second neighborhood conjecture

Suresh Dara

Mathew C. Francis

Dalu Jacob

Narayanan Narayanan

Discrete Appl. Math. 311, 1–17.

2021

Exact square coloring of subcubic planar graphs

Florent Foucaud

Hervé Hocquard

Suchismita Mishra

Narayanan Narayanan

Reza Naserasr

Éric Sopena

Petru Valicov

Discrete Appl. Math. 293, 74–89

2020

Axiomatic Characterization of the interval function of a bipartite graph

Manoj Changat

Ferdoos Hossein Nezhad

Narayanan Narayanan

Discrete Appl. Math. 286, 19–28

2020

Interval function, Induced path function, (claw, paw)-free graphs and axiomatic characterizations

Manoj Changat

Ferdoos Hossein Nezhad

Narayanan N.

Discrete Appl. Math. 280, 53–62

2019

An upper bound for the regularity of binomial edge ideals of trees

A. V. Jayanthan

Narayanan N.

B. V. Raghavendra Rao

J. Algebra Appl. 18, no. 9, 1950170, 7 pp.

Apply NowInformation BrochureBS Sample QuestionsMTech Sample Questions