S. Monikandan

25 papers C 1Journal 21Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the reconstruction number of generalized join of graphs.
Discret. Math.
S. Sathiyabama, S. Monikandan
2025 J jnl
The degree associated edge reconstruction number of bidegreed graphs is at most four.
Ars Comb.
A. Anu, S. Monikandan
2023 J jnl
Recognition of finite bitopological spaces with no isolated point.
Soft Comput.
S. Devi, S. Monikandan
2022 J jnl
Degree Associated Edge Reconstruction Parameters of Strong Double Brooms.
J. Autom. Lang. Comb.
P. Anusha Devi, S. Monikandan
2021 J jnl
Reconstruction number of graphs with unique pendant vertex.
Discret. Appl. Math.
S. Monikandan, A. Anu
2020 J jnl
Degree associated edge reconstruction number of split graphs with biregular independent set is one.
AKCE Int. J. Graphs Comb.
N. Kalai Mathi, S. Monikandan
2020 J jnl
Graphs with arbitrarily large adversary degree associated reconstruction number.
AKCE Int. J. Graphs Comb.
P. Anusha Devi, S. Monikandan
2018 J jnl
Reconstruction of distance hereditary 2-connected graphs.
Discret. Math.
P. Devi Priya, S. Monikandan
2017 J jnl
Degree Associated Reconstruction Number of Graphs with Regular Pruned Graph.
Ars Comb.
P. Anusha Devi, S. Monikandan
2017 J jnl
Degree Associated Reconstruction Parameters of Total Graphs.
Contributions Discret. Math.
P. Anusha Devi, S. Monikandan
2016 — conf
Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two.
ICTCSDM
A. Anu, S. Monikandan
2016 — conf
Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set.
ICTCSDM
N. Kalai Mathi, S. Monikandan
2016 J jnl
Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n-2.
Discret. Math. Algorithms Appl.
A. Anu, S. Monikandan
2016 J jnl
Degree associated reconstruction number of connected digraphs with unique end vertex.
Australas. J Comb.
P. Anusha Devi, S. Monikandan
2016 J jnl
On pairs of graphs having n-2 cards in common.
Ars Comb.
S. Monikandan, J. Balakumar
2015 J jnl
Adversary degree associated reconstruction number of graphs.
Discret. Math. Algorithms Appl.
S. Monikandan, S. Sundar Raj
2015 J jnl
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph.
Electron. J. Graph Theory Appl.
P. Anusha Devi, S. Monikandan
2014 J jnl
A reduction of the Graph Reconstruction Conjecture.
Discuss. Math. Graph Theory
J. Balakumar, S. Monikandan
2013 J jnl
Degree associated edge reconstruction number of graphs.
J. Discrete Algorithms
S. Monikandan, P. Anusha Devi, S. Sundar Raj
2013 J jnl
Pairs of graphs having n-2 cards in common.
Ars Comb.
S. Ramachandran, S. Monikandan
2012 C conf
Degree Associated Edge Reconstruction Number.
IWOCA
S. Monikandan, S. Sundar Raj
2012 J jnl
Reconstruction of bipartite graphs and triangle-free graphs with connectivity two.
Australas. J Comb.
S. Monikandan, J. Balakumar
2009 J jnl
A sufficient condition for Set Reconstruction.
Ars Comb.
S. Ramachandran, S. Monikandan
2009 — conf
SEMALRU: An Implementation of Modified Web Cache Replacement Algorithm.
NaBIC
K. Geetha, N. A. Gounden, S. Monikandan
2007 J jnl
All graphs are set reconstructible if all 2-connected graphs are set reconstructible.
Ars Comb.
S. Ramachandran, S. Monikandan