Papers published in Science Citation Index (SCIE) journals : 18
Papers reviewed in American Mathematical Society Mathematical Reviews : 34
1. S. Devi and S. Monikandan, Recognition of finite topological spaces with no isolated point, Soft Computing 27
(2023), 12049–12056. (SCIE- Journal) (IF 3.2)https://link.springer.com/article/10.1007/s00500-023-08773-x
2. S. Monikandan and A. Anu, Reconstruction Number of Graphs with Unique Pendant Vertex,
Discrete Applied Mathematics 31 (2021), 357-365 (Elsevier) (SCI –Journal) (IF 0.983)
https://doi.org/10.1016/j.dam.2020.06.005 MR4327379
3. P. Anusha Devi and S. Monikandan, Graphs with Arbitrarily Large Adversary Degree Associated Reconstruction
Number AKCE Int. J. Graphs and Combin, . Vol. 17 (3) (2020), 1045-1051.
doi.org/10.1016/ j.akcej.2019.12.022. (SCIE- Journal) (IF 0.8)
4. N. Kalaimathi and S. Monikandan, Degree Associated Edge Reconstruction Number of Split Graphs with
Biregular Independent Set is one, AKCE Int. J. Graphs and Combin. Vol. 17 (3) (2020), 771-776.
doi.org/10.1016/ j.akcej.2019.12.009. (SCIE- Journal) (IF 0.8) MR4181571
5. Anu, A and Monikandan, S.: Nearly all biregular graphs have degree associated edge reconstruction number
at most three, Ars Combinatoria, 147 (2019) 263-280. (SCIE –Journal) (IF 0.259) MR4221178
6. S. Monikandan and N. Kalai Mathi, On the Strong Reconstruction of Nearly Trees Ars Combinatoria,
preprint, 2019. (SCIE –Journal) (IF 0.259)
7. 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) (IF 0.5) https://doi.org/10.1007/s13226-019-0339-2 MR3954538
8. 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
https://doi.org/10.1016/j.disc.2018.05.003.
9. 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 (SCIE –Journal) MR3739055
10. 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) (SCIE –Journal) MR3677149
11. 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. (IF 0.4)
12. Monikandan, S., and Balakumar, J.,: On pairs of graphs having n-2 cards in common, Ars Combinatoria
124 (2016) 289-302. (IF 0.268) (SCIE –Journal) MR3468815
13. 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) (SCIE –Journal) MR3227045
https://doi.org/10.7151/dmgt.1746
14. Ramachandran, S., and Monikandan, S.,: Pairs of graphs having n-2 cards in common, Ars Combinatoria,
112 (2013) 213-224. (IF 0.204) (SCIE –Journal) MR3112577
15. Ramachandran, S., and Monikandan, S.,: A sufficient condition for Set Reconstruction, Ars Combinatoria,
91 (2009), 439 – 446. MR# 2010f:05126 (IF 0.396) (SCIE –Journal)
16. 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) (SCIE –Journal)
17. 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) (SCIE –Journal)
18. 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)
(SCIE –Journal)
1. S. Devi and S.Monikandan, Recognition of finite bitopological spaces with unique isolated point,
Sahand Communications in Mathematical Analysis (2024) (Accepted)
2. V. Manikandan and S. Monikandan, C5-Free Nonsplit graphs with split maximal induced
subgraphs, J. Indones. Math Soc, 23(02) (2023) 217-234 . (IF 0.5)
3. A. Josephine Shilpa Devi and S. Monikandan, Reconstruction of Topological spaces from
n points deleted subspaces, J. Adv. Math. Stud. 16 (1) (2023), 01-14. MR4678423
4. P. Anusha Devi and S. Monikandan, Degree Associated Edge Reconstruction Parameters
of Strong Double Brooms, Journal of Automata, Languages and Combinatorics
27(2022), 259-269 (IF 0.486) . DOI: 10.25596/jalc-2022-259. MR4526295
5. P. Devi Priya and S. Monikandan, Reconstruction of 2-connected parity graphs,
Australasian J. Combinatorics 80 (2) (2021), 167–177 (IF 0.4) . MR4284754
6. A. Anat Jaslin Jini and S. Monikandan, Reconstruction Number of Finite Topological Spaces
with unique Isolated Point, Acta Universitatis Apulensis No. 65 (2021), 89-110.
7. P. Devi Priya and S. Monikandan, Stronger reconstruction of distance-hereditary Graphs,
TWMS J. App. and Eng. Math. (Proceedings of the International Conference on Graph
Theory and its Applications (ICGTA 2019), held at SSN College of Engineering, Chennai
during 20-21, November 2019) Vol. 11, Special Issue (2021), 25-29.
8. A. Anat Jaslin Jini and S. Monikandan, All Finite Topological Spaces Are Weakly
Reconstructible, Springer Proceedings in Mathematics & Statistics (Proceedings
of the International Conference on Mathematical Analysis and Computing (ICMAC – 2019)
held at SSN College of Engineering, Chennai during 23-24, December 2019) Vol. 344 (2021),
78-95. (IF 0.278) MR4281575
9. P. Devi Priya and S. Monikandan, Reconstruction of 2-connected Paw-free Graphs,
AIP Conference Proceedings 2261, 030017 (2020) (Int. Conf. on Adv. Applicable.
Math. held at Bharathiar University during 21-22 Feb. 2020).
https://doi.org/10.1063/5.0017153. (IF 0.4)
10. A. Anat Jaslin Jini and S. Monikandan, Reconstruction of finite topological spaces
with more than one isolated point, Advances in Mathematics: Scientific Journal
9 (4) (2020), 1487–1493. https://doi.org/10.37418/amsj.9.4.2. MR4252919
11. 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. MR3930150
12. S. Monikandan and N. Kalai Mathi.,: On the Stronger Reconstruction of Nearly Acyclic
Graphs, J. Combin Maths. and Combin. Comput, 113, 49-64 (2020). MR4250928
13. 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
https://doi.org/10.1007/978-3-319-64419-6_14 (IF 1.063) MR3696712
14. 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
19-21, 2016), LNCS 10398, Springer-Verlag, Berlin, p. 1-9, 2017. MR3696699
https://doi.org/10.1007/978-3-319-64419-6_1 (IF 1.063) MR3696699
15. Anu, A and Monikandan, S.: Degree associated reconstruction number of certain connected
graphs with unique end vertex and a vertex of degree n−2, Discrete Mathematics,
Algorithms and Applications, Vol. 8, No. 4 (2017) , 1650068-1 –1650068-16.
https://doi.org/10.1142/s1793830916500683 MR3569773
16. 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 (IF 0.4) .
17. 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 (IF 0.605) MR3417912 https://doi.org/10.5614/ejgta.2015.3.2.4
18. 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 https://doi.org/10.1142/s1793830914500694
19. 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.
20. 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). https://doi.org/10.1016/j.jda.2013.08.003
21. 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.
22. 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, (IF 0.7) http://dx.doi.org/10.1155/2013/808105.
23. 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 https://doi.org/10.1007/978-3-642-35926-2_12 (IF 1.063)
24. Monikandan, S., and Balakumar, J.,: Reconstruction of bipartite graphs and triangle-free
graphs with connectivity two, Australasian J. Combinatorics, 53 (2012), 141-150 (IF 0.4).
MR 2961979
25. 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)
26. 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 (IF 0.2)
1. Manikandan and S. Monikandan, Algorithm for Reconstruction number of Split graphs,
Lecture Notes in Networks and Systems 964, Springer, 2024, 45-52.
ISBN: 978-981-97-2065-1 (IF 0.525) MR4786871
2. A. Josephine Shilpa Devi and S. Monikandan, Reconstruction of soft topological spaces,
Proceedings of the National Conference on Algebraic Graph Theory, Graph Theory and
Analysis (MSUMEC 2023) held at Manonmaniam Sundaranar University, Tirunelveli
during February 23-24, 2023, pages 52-60. ISBN:978-81-965238-3-1.
3. S. Devi and S. Monikandan, Property reconstruction of certain bitopological spaces,
Proceedings of the National Conference on Algebraic Graph Theory, Graph Theory
and Analysis (MSUMEC 2023) held at Manonmaniam Sundaranar University, Tirunelveli
during February 23-24, 2023, pages 21-30. ISBN:978-81-965238-3-1.
4. V. Manikandan and S. Monikandan, Split graphs with Nonsplit edge cards,
and Analysis (MSUMEC 2023) held at Manonmaniam Sundaranar University,
Tirunelveli during February 23-24, 2023, pages 84-89. ISBN:978-81-965238-3-1.
5. A. Josephine Shilpa Devi and S. Monikandan, Reconstruction of Separation Axioms
of Topological Spaces and Soft Spaces, Proceedings of International Conference on
Analysis and Number Theory - 2022 held at Ayya Nadar Janaki Ammal College,
Sivakasi during 27 - 29 October 2022. ISBN: 978-93-83191-89-5
6. S. Devi and S. Monikandan, Recognizable Properties of Finite Bitopological Spaces,
Proceedings of International Conference on Analysis and Number Theory - 2022 held at
Ayya Nadar Janaki Ammal College, Sivakasi during 27 - 29 October 2022.
ISBN: 978-93-83191-89-5
7. S. Monikandan and P. Devi Priya, Progress on the Reconstruction Conjecture,
Indian J. Discrete Math. 7 (1) (2021), 1–26. MR4729239
8. A. Anat Jaslin Jini and S. Monikandan, Reconstruction properties of Bitopological spaces,
proceedings of the International Conference on Mathematical, Physics and Dynamics
held at Solapur, India, on Dec. 11, 2020, pp 1-4.
9. Ramachandran, S., and Monikandan, S.,: A note on the edge reconstruction problem,
Int. J. of Manage. and systems 20 (2004) 229-234.
Disclaimer: The details in the webpages on view more option are fully maintained by the faculty members concerned. The university is not responsible for any data provided in the view more option in faculty profile.
