S. Arumugam

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 44

Top Topics

Cellular Manufacturing

Visual Cryptography Scheme

Bipartite Graph

Noise Elimination

Top Venues

AKCE Int. J. Graphs Comb.

Electron. Notes Discret. Math.

Discret. Math. Algorithms Appl.

Publications

Jessica Pereira, Tarkeshwar Singh, S. Arumugam
Additively graceful signed graphs. AKCE Int. J. Graphs Comb. 20 (3) (2023)
K. Muhammed Sabeel, Krishnan Paramasivam, Appattu Vallapil Prajeesh, Nainarraj Kamatchi, S. Arumugam
A characterization of group vertex magic trees of diameter up to 5. Australas. J Comb. 85 (2023)
Purnima Gupta, Alka Goyal, S. Arumugam
Line-set domination in graphs. Discret. Math. Algorithms Appl. 15 (5) (2023)
Seena Varghese, S. Aparna Lakshmanan, S. Arumugam
Two extensions of Leech labeling to the class of all graphs. AKCE Int. J. Graphs Comb. 19 (2) (2022)
Amit Sharma, Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam
Algorithmic aspects of outer independent Roman domination in graphs. Discret. Math. Algorithms Appl. 14 (5) (2022)
B. Suganya, S. Arumugam
Independent resolving sets in graphs. AKCE Int. J. Graphs Comb. 18 (2) (2021)
Pambe Biatch' Max, Jay S. Bagga, S. Arumugam
A survey and a new class of graceful unicylic graphs. AKCE Int. J. Graphs Comb. 17 (2) (2020)
S. Arumugam, Jay S. Bagga
Preface. AKCE Int. J. Graphs Comb. 17 (2) (2020)
S. Sudha, S. Arumugam
Min-max and max-min graph saturation parameters. AKCE Int. J. Graphs Comb. 17 (3) (2020)
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam
Algorithmic complexity of secure connected domination in graphs. AKCE Int. J. Graphs Comb. 17 (3) (2020)
Jessica Pereira, Tarkeshwar Singh, S. Arumugam
Edge consecutive gracefulness of a graph. Discret. Appl. Math. 280 (2020)
Nancy Jaseintha Cutinho, S. Sudha, S. Arumugam
Distance antimagic labelings of Cartesian product of graphs. AKCE Int. J. Graphs Comb. 17 (3) (2020)
Manju Raju, Kiran R. Bhutani, Babak Moazzez, S. Arumugam
On -domination in graphs. AKCE Int. J. Graphs Comb. 17 (1) (2020)
Nainarraj Kamatchi, Krishnan Paramasivam, Appattu Vallapil Prajeesh, K. Muhammed Sabeel, S. Arumugam
On group vertex magic graphs. AKCE Int. J. Graphs Comb. 17 (1) (2020)
Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam
Algorithmic Complexity of Secure Connected Domination in Graphs. CoRR (2020)
Purnima Gupta, Rajesh Singh, S. Arumugam
Graphs with equal domination and independent domination numbers. AKCE Int. J. Graphs Comb. 17 (2) (2020)
S. Arumugam, Jay S. Bagga
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs. AKCE Int. J. Graphs Comb. 17 (2) (2020)
S. Arumugam, K. Raja Chandrasekar
Linear time algorithm for dominator chromatic number of trestled graphs. Discret. Math. Algorithms Appl. 11 (6) (2019)
S. V. Divya Rashmi, A. Somasundaram, S. Arumugam
Secure domination subdivision number of a graph. Discret. Math. Algorithms Appl. 11 (3) (2019)
Deepti Jain, Purnima Gupta, S. Arumugam
Minimal 2-point set dominating sets of a graph. AKCE Int. J. Graphs Comb. 14 (2) (2017)
R. Lakshmanan, S. Arumugam
Construction of a (k, n)-visual cryptography scheme. Des. Codes Cryptogr. 82 (3) (2017)
Adarsh K. Handa, Aloysius Godinho, Tarkeshwar Singh, S. Arumugam
Distance antimagic labeling of join and corona of two graphs. AKCE Int. J. Graphs Comb. 14 (2) (2017)
B. Jayaram, S. Arumugam, K. Thulasiraman
Dominator sequences in bipartite graphs. Theor. Comput. Sci. 694 (2017)
Purnima Gupta, Rajesh Singh, S. Arumugam
Graphoidal Length and Graphoidal Covering Number of a Graph. ICTCSDM (2016)
P. Mohanakrishnan, K. Suthendran, S. Arumugam, T. Panneerselvam
Mixed Noise Elimination and Data Hiding for Secure Data Transmission. ICTCSDM (2016)
M. Sundarakannan, S. Arumugam
Signed Cycle Domination in Planar Graphs. ICTCSDM (2016)
S. Rajeswari, M. Indhumathy, A. Somasundaram, Neeru Sood, S. Arumugam
Identification of Salinity Stress Tolerant Proteins in Sorghum Bicolor Computational Approach. ICTCSDM (2016)
B. Suganya, S. Arumugam
Independent Resolving Number of Convex Polytopes. ICTCSDM (2016)
A. Muthuselvi, S. Arumugam
Upper Majority Domination Number of a Graph. ICTCSDM (2016)
S. Rajeswari, K. Suthendran, K. Rajakumar, S. Arumugam
An Overview of the MapReduce Model. ICTCSDM (2016)
S. Arumugam, Purnima Gupta, Rajesh Singh
Bounds on Graphoidal Length of a Graph. Electron. Notes Discret. Math. 53 (2016)
S. Arumugam, Kiran R. Bhutani, L. Sathikala
On (r, s)-Fuzzy Domination in Fuzzy Graphs. New Math. Nat. Comput. 12 (1) (2016)
M. Nalliah, S. Arumugam
Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars. ICTCSDM (2016)
S. Fepslin Athish Mon, K. Suthendran, K. Arjun, S. Arumugam
A Novel Reversible Data Hiding Method in Teleradiology to Maximize Data Capacity in Medical Images. ICTCSDM (2016)
T. Subburaj, K. Suthendran, S. Arumugam
Statistical Approach to Trace the Source of Attack Based on the Variability in Data Flows. ICTCSDM (2016)
K. Kanchan Devi, S. Arumugam
Probabilistic Conjunctive Grammar. ICTCSDM (2016)
Jessica Pereira, Tarkeshwar Singh, S. Arumugam
m-Gracefulness of Graphs. CALDAM (2016)
Aloysius Godinho, Tarkeshwar Singh, S. Arumugam
On Nearly Distance Magic Graphs. ICTCSDM (2016)
S. V. Divya Rashmi, A. Somasundaram, S. Arumugam
Upper Secure Domination Number of a Graph. Electron. Notes Discret. Math. 53 (2016)
S. V. Divya Rashmi, S. Arumugam, A. Somasundaram
Global Secure Domination in Graphs. ICTCSDM (2016)
Nainarraj Kamatchi, Gurusamy Rengasamy Vijayakumar, A. Ramalakshmi, S. Nilavarasi, S. Arumugam
Distance Antimagic Labelings of Graphs. ICTCSDM (2016)
Purnima Gupta, Rajesh Singh, S. Arumugam
Characterizing minimal point set dominating sets. AKCE Int. J. Graphs Comb. 13 (3) (2016)
S. Arumugam, J. Saral, A. Somasundaram
Minimizing the Number of Exceptional Edges in Cellular Manufacturing Problem. Electron. Notes Discret. Math. 53 (2016)
J. Maria Jeyaseeli, Nazanin Movarraei, S. Arumugam
Dominator Coloring of Generalized Petersen Graphs. ICTCSDM (2016)
S. Arumugam, M. Nalliah
Super (a, d)-edge antimagic total labelings of friendship and generalized friendship graphs. Electron. Notes Discret. Math. 48 (2015)
Aloysius Godinho, Tarkeshwar Singh, S. Arumugam
On S-Magic Graphs. Electron. Notes Discret. Math. 48 (2015)
Jessica Pereira, Tarkeshwar Singh, S. Arumugam
A New Measure for Gracefulness of Graphs. Electron. Notes Discret. Math. 48 (2015)
S. Arumugam, Dalibor Froncek, Joe Ryan, Kiki Ariyanti Sugeng, Martin Baca, Mirka Miller
Preface. Electron. Notes Discret. Math. 48 (2015)
Jay S. Bagga, Laure Pauline Fotso, Pambe Biatch' Max, S. Arumugam
New Classes of Graceful Unicyclic Graphs. Electron. Notes Discret. Math. 48 (2015)
S. Arumugam, B. Jayaram, K. Thulasiraman
Independent Dominator Sequence Number of a Graph. ICGTIS (2015)
M. Balakrishnan, G. Marimuthu, S. Arumugam
Vertex in-magic arc labelings of digraphs. Electron. Notes Discret. Math. 48 (2015)
P. Jeya Bala Chitra, S. Arumugam
Resolving Sets without Isolated Vertices. ICGTIS (2015)
Jessica Pereira, Tarkeshwar Singh, S. Arumugam
On (k, d)-Skolem Graceful Graphs. Electron. Notes Discret. Math. 48 (2015)
Martín Manrique, S. Arumugam
Vertex and Edge Dimension of Hypergraphs. Graphs Comb. 31 (1) (2015)
Nainarraj Kamatchi, A. Ramalakshmi, S. Nilavarasi, S. Arumugam
A note on Distance Magic and Distance antimagic graphs. Electron. Notes Discret. Math. 48 (2015)
S. Arumugam, J. Saral
Identification of Bottleneck Elements in Cellular Manufacturing Problem. ICGTIS (2015)
S. Arumugam, R. Lakshmanan, Atulya K. Nagar
On (k, n)*-visual cryptography scheme. Des. Codes Cryptogr. 71 (1) (2014)
S. Arumugam, Bibin K. Jose, Csilla Bujtás, Zsolt Tuza
Equality of domination and transversal numbers in hypergraphs. Discret. Appl. Math. 161 (13-14) (2013)
S. Arumugam, Varughese Mathew, Jian Shen
On fractional Metric Dimension of graphs. Discret. Math. Algorithms Appl. 5 (4) (2013)
S. Arumugam, R. Lakshmanan, Atulya K. Nagar
Graph access structures with optimal pixel expansion three. Inf. Comput. 230 (2013)
S. Arumugam, William F. Smyth
Editorial. J. Discrete Algorithms 23 (2013)
S. Arumugam, Kalimuthu Karuppasamy, Varughese Mathew
Fractional distance domination in graphs. Discuss. Math. Graph Theory 32 (3) (2012)
S. Arumugam, Nainarraj Kamatchi
On (a, d)-distance antimagic graphs. Australas. J Comb. 54 (2012)
S. Arumugam, Varughese Mathew
The fractional metric dimension of graphs. Discret. Math. 312 (9) (2012)
S. Arumugam, M. Nalliah
Super (a, d)-edge antimagic total labelings of friendship graphs. Australas. J Comb. 53 (2012)
S. Arumugam, K. Raja Chandrasekar
Minimal dominating sets in maximum domatic partitions. Australas. J Comb. 52 (2012)
S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh
Algorithmic Aspects of Dominator Colorings in Graphs. IWOCA (2011)
S. Arumugam, Teresa W. Haynes, Michael A. Henning, Yared Nigussie
Maximal independent sets in minimum colorings. Discret. Math. 311 (13) (2011)
A. Anitha, S. Arumugam, Mustapha Chellali
Equitable domination in Graphs. Discret. Math. Algorithms Appl. 3 (3) (2011)
S. Arumugam, Odile Favaron, S. Sudha
Irredundance saturation number of a graph. Australas. J Comb. 46 (2010)
S. Arumugam, Kalimuthu Karuppasamy, Ismail Sahul Hamid
Fractional global domination in graphs. Discuss. Math. Graph Theory 30 (1) (2010)
S. Arumugam, R. Kala
A Note On Global Domination In Graphs. Ars Comb. 93 (2009)
K. Reji Kumar, S. Arumugam, Gary MacGillivray
On Maximal Fractional Independent Sets In Graphs. Ars Comb. 87 (2008)
S. Arumugam, K. Jacob, Lutz Volkmann
Total and connected domination in digraphs. Australas. J Comb. 39 (2007)
R. M. Suresh, S. Arumugam
Fuzzy technique based recognition of handwritten characters. Image Vis. Comput. 25 (2) (2007)
S. Arumugam, I. Sahul Hamid
Simple acyclic graphoidal covers in a graph. Australas. J Comb. 37 (2007)
K. Muneeswaran, L. Ganesan, S. Arumugam, K. Ruba Soundar
Texture image segmentation using combined features from spatial and spectral distribution. Pattern Recognit. Lett. 27 (7) (2006)
K. Muneeswaran, L. Ganesan, S. Arumugam, K. Ruba Soundar
Texture classification with combined rotation and scale invariant wavelet features. Pattern Recognit. 38 (10) (2005)
K. Muneeswaran, L. Ganesan, S. Arumugam, P. Harinarayan
A Novel Approach Combining Gabor Wavelet and Moments for Texture Segmentation. Int. J. Wavelets Multiresolution Inf. Process. 3 (4) (2005)
S. Arumugam, Hepzibai Jeyakumar
Asteroidal Chromatic Number of a Graph. Electron. Notes Discret. Math. 15 (2003)
R. M. Suresh, S. Arumugam
Fuzzy Technique Based Recognition of Handwritten Characters. WILF (2003)
K. Ramar, S. Arumugam, S. N. Sivanandam, L. Ganesan, D. Manimegalai
Quantitative fuzzy measures for threshold selection. Pattern Recognit. Lett. 21 (1) (2000)
S. Thamarai Selvi, S. Arumugam, L. Ganesan
BIONET: an artificial neural network model for diagnosis of diseases. Pattern Recognit. Lett. 21 (8) (2000)
S. Arumugam, S. Velammal
Maximum Size of a Connected Graph with Given Domination Parameters. Ars Comb. 52 (1999)
S. Arumugam, R. Kala
Domination parameters of star graph. Ars Comb. 44 (1996)
S. Arumugam, K. Augustine Germina
On indexable graphs. Discret. Math. 161 (1-3) (1996)