Total : 45 ( National : 7 & International : 38)
Science Citation Index (SCI / SCIE) Journals : 17
Papers Reviewed in American Mathematical
Society Mathematical Reviews : 28
S. Monikandan and P. Devi Priya, Progress on the Reconstruction Conjecture, Indian J. Discrete Math. (2021) (In Press).
P. Devi Priya and S. Monikandan, Reconstruction of 2-connected parity graphs, Australasian J. Combinatorics 80(2) (2021), 167–177.
S. Monikandan and A. Anu., Reconstruction Number of Graphs with Unique Pendant Vertex, Discrete Applied Mathematics (Elsevier), Published online 13 June, 2020 (SCI –Journal) (IF 0.983) https://doi.org/10.1016/j.dam.2020.06.005
Anusha Devi, P., and Monikandan, S.,: Graphs with Arbitrarily Large Adversary Degree Associated Reconstruction Number AKCE Int. J. Graphs and Combin, Published online: 18 May 2020, 7 pages, doi.org/10.1016/ j.akcej.2019.12.022. ( listed in SCI Journals in October 2020)
Kalaimathi, N. and Monikandan, S.,: Degree Associated Edge Reconstruction Number of Split Graphs with Biregular Independent Set is one (presented in International Conference on Theoretical Computer Science and Discrete Mathematics” held at S.S.N. College, Chennai during Dec. 03-05, 2018) AKCE Int. J. Graphs and Combin. Published online: 24 Apr 2020, 6 pages, doi.org/10.1016/ j.akcej.2019.12.009. ( listed in SCI Journals in October 2020)
S. Monikandan and N. Kalai Mathi, : On the Strong Reconstruction of Nearly Trees, Ars Combinatoria, preprint, 2019. (SCI –Journal)
P. Devi Priya, and S. Monikandan.,: Distance hereditary graphs G of connectivity two or three and diam(G) = diam(G) = 3 are reconstructible, Indian Journal of Pure and Applied Mathematics 50 (2) (2019), 477-484. (SCI –Journal)
S. Monikandan and N. Kalai Mathi: Degree Associated Edge reconstruction Number of Split Graphs with regular Independent set is one or two, Journal of Combinatorics and Number Theory 10 ( 1) (2019), 63-73.
P. Devi Priya, and S. Monikandan.,: Reconstruction of distance hereditary 2-connected graphs, Discrete Mathematics (Elsevier) 341 (2018), 2326–2331. (SCI –Journal) (IF 0.639) MR3810280
S. Monikandan and N. Kalai Mathi.,: On the Stronger Reconstruction of Nearly Acyclic Graphs, J. Combin Maths. and Combin. Comput, (2018) (In press)
Anu, A and Monikandan, S.: Nearly all biregular graphs have degree associated edge reconstruction number at most three, Ars Combinatoria, 147 (2020) 263-280.(IF 0.259) (SCI –Journal)
Kalaimathi, N. and Monikandan, S.,: Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set, Proceedings of the International Conference on Theoretical Comp. Sci. and Discrete Math. (held at Kalasalingam University, India, December 19-21, 2016), LNCS 10398, Springer-Verlag, Berlin, p. 106-112, 2017. MR3696712
Anu, A and Monikandan, S.: Degree Associated Reconstruction Number of Biregular Bipartite Graphs with Degrees Differ by At Least Two, Proceedings of the International Conference on Theoretical Comp. Sci. and Discrete Math. (held at Kalasalingam University, India, December 19-21, 2016), LNCS 10398, Springer-Verlag, Berlin, p. 1-9, 2017. MR3696699
Anusha Devi, P., and Monikandan, S.,: Degree Associated Reconstruction Parameters of Total Graphs, Contributions to Discrete Mathematics, Vol. 12 (2) (2017), 77-90. IF-0.28 (SCI –Journal) MR3739055
Anusha Devi, P., and Monikandan, S.,: Degree Associated Reconstruction Number of Graphs with Regular Pruned Graph, Ars Combinatoria, 134 (2017) 29-41.(IF 0.259) (SCI –Journal) MR3677149
Anusha Devi, P., and Monikandan, S.,:Degree Associated Reconstruction Number of Certain Connected Digraphs with Unique End vertex, Australasian J. Combinatorics, Vol. 66 (3) (2016), 365–377.
Monikandan, S., and Balakumar, J.,: On pairs of graphs having n-2 cards in common, Ars Combinatoria 124 (2016) 289-302. (IF 0.268) (SCI –Journal) MR3468815
Anusha Devi, P., and Monikandan, S.,: Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph, Electron. J. Graph Theory Appl. 3 (2) (2015) 146-161. DOAJ 2338-2287 MR3417912
Monikandan, S., and Sundar Raj, S.,: Adversary Degree Associated Reconstruction Number, Discrete Mathematics, Algorithms and Applications, Vol. 7, No. 1 (2015) , 1450069-1 –1450069-16. MR3305479
Monikandan, S., and Balakumar, J.,: A Reduction of The Graph Reconstruction Conjecture, Discussiones Mathematicae Graph Theory, Vol. 34, No. 3 (2014), 529-537. (IF 0.282) (SCI –Journal) MR3227045
Anu, A and Monikandan, S.: Degree Associated Reconstruction Number of Graphs Obtained by certain Graph Operations, Journal of Combinatorics, Information & System Sciences 39, No. 1-4 (2014), 135–148.
Monikandan, S., Anusha Devi, P., and Sundar Raj, S.,: Adversary Degree Associated Reconstruction Number of Graphs, J. of Discrete Algorithm (Elsevier), 23 (2013) 35-41. MR#3132878 (IF: 0.91).
Ramachandran, S., and Monikandan, S.,: Pairs of graphs having n-2 cards in common, Ars Combinatoria, 112 (2013) 213-224 (IF 0.204) (SCI –Journal) MR3112577
Sundar Raj, S., and Monikandan, S.,: Adversary Degree Associated Reconstruction Number of Graphs obtained from Complete graphs or Cycles. J. of Combinatorics, Information and System Sciences, Vol. 37, No. 1 (2012), 75-94.
Monikandan, S., Sundar Raj, S., Jayasekaran, C., and Santhakumaran, A.P.,: A note on the Adversary Degree Associated Reconstruction Number of Graphs, J. of Discrete Mathematics, (2013), 5 pages, http://dx.doi.org/10.1155/2013/808105.
Monikandan, S., and Sundar Raj, S.,: Degree associated edge reconstruction number, Combinatorial Algorithms, Lecture Notes in Computer Science 7643 (Springer-Verlag, Berlin, 2012), 100--109. MR3056380
Monikandan, S., and Balakumar, J.,: Reconstruction of bipartite graphs and triangle-free graphs with connectivity two, Australasian J. Combinatorics, 53 (2012), 141-150. MR 2961979
Ramachandran, S., and Monikandan, S.,: Graph Reconstruction Conjecture: Reductions using complement, connectivity and distance, Bull. of Institute of Combinatorics and Its Applications, 56 (2009), 103 –108. MR# 2010g:05250 (IF 0.2)
Ramachandran, S., and Monikandan, S.,: A sufficient condition for Set Reconstruction, Ars Combinatoria, 91 (2009), 439 – 446. MR# 2010f:05126 (IF 0.396) (SCI –Journal)
Ramachandran, S., and Monikandan, S.,: Graphs with n-3 isomorphic vertex-deleted subgraphs, and their reconstructibility, Utilitas Mathematica, 75 (2008), 225 – 248. MR# 2009f:05184. (IF 0.707) (SCI –Journal)
Ramachandran, S., and Monikandan, S.,: All graphs are set-reconstructible if all 2-connected graphs are set-reconstructible, Ars Combinatoria, 83 (2007), 341 – 352. MR# 2007m:05170 (IF 0.315) (SCI –Journal)
Ramachandran, S., and Monikandan, S.,: A weaker form of Ulam’s Conjecture, Bull. of Institute of Combinatorics and Its Applications, 49 (2007), 87–92. MR 2285525
Ramachandran, S., and Monikandan, S.,: All digraphs are N-reconstructible if all digraphs with 2- connected underlying graphs are N-reconstructible, Utilitas Mathematica 71 (2006), 225 – 234. MR 2278835 (IF 0.707) (SCI –Journal).
Books Written
No of Books Written : 4
Title : Degree Associated Reconstruction Number of Graphs
Publisher : Lambert Academic Publishing, Germany, 2019.
ISBN : 978-613-9-57926-6
Title : Structures of Graphs from Rings
Publisher : University publication, M.S.University, 2018.
Co-authors : T. Tamizh Chelvam, K. Selvakumar
Title : Recent advances in graph reconstruction
Publisher : Lambert Academic Publishing, Germany, 2014.
ISBN : 978-3-659-61383-8
Co-author : J. balakumar
Writing a chapter in a Book
Chapter Title : Reconstruction of graphs
Title of the book : Graph Theory
Publisher : Intech Open, London, 2021.
Editor : Harun Pirim
ISBN : 978-1-83969-527-8