S. Monikandan

Publication Activity (10 Years)

Years Active: 2007-2023
Publications (10 Years): 13

Top Topics

Connected Graphs

Independent Set

Image Reconstruction

Top Venues

AKCE Int. J. Graphs Comb.

Discret. Math. Algorithms Appl.

Publications

S. Devi, S. Monikandan
Recognition of finite bitopological spaces with no isolated point. Soft Comput. 27 (17) (2023)
P. Anusha Devi, S. Monikandan
Degree Associated Edge Reconstruction Parameters of Strong Double Brooms. J. Autom. Lang. Comb. 27 (4) (2022)
S. Monikandan, A. Anu
Reconstruction number of graphs with unique pendant vertex. Discret. Appl. Math. 305 (2021)
P. Anusha Devi, S. Monikandan
Graphs with arbitrarily large adversary degree associated reconstruction number. AKCE Int. J. Graphs Comb. 17 (3) (2020)
N. Kalai Mathi, S. Monikandan
Degree associated edge reconstruction number of split graphs with biregular independent set is one. AKCE Int. J. Graphs Comb. 17 (3) (2020)
P. Devi Priya, S. Monikandan
Reconstruction of distance hereditary 2-connected graphs. Discret. Math. 341 (8) (2018)
P. Anusha Devi, S. Monikandan
Degree Associated Reconstruction Parameters of Total Graphs. Contributions Discret. Math. 12 (2) (2017)
P. Anusha Devi, S. Monikandan
Degree Associated Reconstruction Number of Graphs with Regular Pruned Graph. Ars Comb. 134 (2017)
S. Monikandan, J. Balakumar
On pairs of graphs having n-2 cards in common. Ars Comb. 124 (2016)
P. Anusha Devi, S. Monikandan
Degree associated reconstruction number of connected digraphs with unique end vertex. Australas. J Comb. 66 (2016)
A. Anu, S. Monikandan
Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two. ICTCSDM (2016)
A. Anu, S. Monikandan
Degree associated reconstruction number of certain connected graphs with unique end vertex and a vertex of degree n-2. Discret. Math. Algorithms Appl. 8 (4) (2016)
N. Kalai Mathi, S. Monikandan
Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set. ICTCSDM (2016)
P. Anusha Devi, S. Monikandan
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph. Electron. J. Graph Theory Appl. 3 (2) (2015)
S. Monikandan, S. Sundar Raj
Adversary degree associated reconstruction number of graphs. Discret. Math. Algorithms Appl. 7 (1) (2015)
J. Balakumar, S. Monikandan
A reduction of the Graph Reconstruction Conjecture. Discuss. Math. Graph Theory 34 (3) (2014)
S. Monikandan, P. Anusha Devi, S. Sundar Raj
Degree associated edge reconstruction number of graphs. J. Discrete Algorithms 23 (2013)
S. Ramachandran, S. Monikandan
Pairs of graphs having n-2 cards in common. Ars Comb. 112 (2013)
S. Monikandan, J. Balakumar
Reconstruction of bipartite graphs and triangle-free graphs with connectivity two. Australas. J Comb. 53 (2012)
S. Monikandan, S. Sundar Raj
Degree Associated Edge Reconstruction Number. IWOCA (2012)
K. Geetha, N. A. Gounden, S. Monikandan
SEMALRU: An Implementation of Modified Web Cache Replacement Algorithm. NaBIC (2009)
S. Ramachandran, S. Monikandan
A sufficient condition for Set Reconstruction. Ars Comb. 91 (2009)
S. Ramachandran, S. Monikandan
All graphs are set reconstructible if all 2-connected graphs are set reconstructible. Ars Comb. 83 (2007)