Subramanian Arumugam

According to our database, Subramanian Arumugam authored at least 93 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

An improved upper bound for the domination number of a graph.

Subramanian Arumugam, Suresh Manjanath Hegde, Shashanka Kulamarva

CoRR, 2024

2023

Line-set domination in graphs.

Purnima Gupta, Alka Goyal, S. Arumugam

Discret. Math. Algorithms Appl., July, 2023

Stress of a graph and its computation.

Raksha Poojary, Arathi Bhat K., Subramanian Arumugam, Manjunatha Prasad Karantha

AKCE Int. J. Graphs Comb., May, 2023

A characterization of group vertex magic trees of diameter up to 5.

K. Muhammed Sabeel, Krishnan Paramasivam, Appattu Vallapil Prajeesh, Nainarraj Kamatchi, S. Arumugam

Australas. J Comb., 2023

2022

Algorithmic aspects of outer independent Roman domination in graphs.

Amit Sharma, Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam

Discret. Math. Algorithms Appl., 2022

Two extensions of Leech labeling to the class of all graphs.

Seena Varghese, S. Aparna Lakshmanan, S. Arumugam

AKCE Int. J. Graphs Comb., 2022

Truly non-trivial graphoidal graphs.

Rajesh Singh, Purnima Gupta, S. Arumugam

AKCE Int. J. Graphs Comb., 2022

2021

Independent resolving sets in graphs.

B. Suganya, S. Arumugam

AKCE Int. J. Graphs Comb., 2021

2020

Two classes of non-Leech trees.

Seena Varghese, S. Aparna Lakshmanan, Subramanian Arumugam

Electron. J. Graph Theory Appl., 2020

Edge consecutive gracefulness of a graph.

Jessica Pereira, Tarkeshwar Singh, S. Arumugam

Discret. Appl. Math., 2020

Min-max and max-min graph saturation parameters.

S. Sudha, S. Arumugam

AKCE Int. J. Graphs Comb., 2020

On -domination in graphs.

Manju Raju, Kiran R. Bhutani, Babak Moazzez, S. Arumugam

AKCE Int. J. Graphs Comb., 2020

A survey and a new class of graceful unicylic graphs.

Pambe Biatch' Max, Jay S. Bagga, S. Arumugam

AKCE Int. J. Graphs Comb., 2020

Algorithmic complexity of secure connected domination in graphs.

Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam

AKCE Int. J. Graphs Comb., 2020

On group vertex magic graphs.

Nainarraj Kamatchi, Krishnan Paramasivam, Appattu Vallapil Prajeesh, K. Muhammed Sabeel, S. Arumugam

AKCE Int. J. Graphs Comb., 2020

Graphs with equal domination and independent domination numbers.

Purnima Gupta, Rajesh Singh, S. Arumugam

AKCE Int. J. Graphs Comb., 2020

Distance antimagic labelings of Cartesian product of graphs.

Nancy Jaseintha Cutinho, S. Sudha, S. Arumugam

AKCE Int. J. Graphs Comb., 2020

Graphoidal graphs and graphoidal digraphs: a generalization of line graphs.

S. Arumugam, Jay S. Bagga

AKCE Int. J. Graphs Comb., 2020

Preface.

S. Arumugam, Jay S. Bagga

AKCE Int. J. Graphs Comb., 2020

2019

Secure domination subdivision number of a graph.

S. V. Divya Rashmi, A. Somasundaram, S. Arumugam

Discret. Math. Algorithms Appl., 2019

Linear time algorithm for dominator chromatic number of trestled graphs.

S. Arumugam, K. Raja Chandrasekar

Discret. Math. Algorithms Appl., 2019

2018

The distance magic index od a graph.

Subramanian Arumugam, Aloysius Godinho, Tarkeshwar Singh

Discuss. Math. Graph Theory, 2018

2017

Dominator sequences in bipartite graphs.

B. Jayaram, S. Arumugam, Krishnaiyan Thulasiraman

Theor. Comput. Sci., 2017

Local Antimagic Vertex Coloring of a Graph.

Subramanian Arumugam, K. Premalatha, Martin Baca, Andrea Semanicová-Fenovcíková

Graphs Comb., 2017

Construction of a (k, n)-visual cryptography scheme.

R. Lakshmanan, S. Arumugam

Des. Codes Cryptogr., 2017

Minimal 2-point set dominating sets of a graph.

Deepti Jain, Purnima Gupta, S. Arumugam

AKCE Int. J. Graphs Comb., 2017

Distance antimagic labeling of join and corona of two graphs.

Adarsh K. Handa, Aloysius Godinho, Tarkeshwar Singh, S. Arumugam

AKCE Int. J. Graphs Comb., 2017

2016

On (r, s)-Fuzzy Domination in Fuzzy Graphs.

S. Arumugam, Kiran R. Bhutani, L. Sathikala

New Math. Nat. Comput., 2016

On the use of secret sharing as a secure multi-use pad.

Neil Buckley, Atulya K. Nagar, Subramanian Arumugam

Innov. Syst. Softw. Eng., 2016

Upper Secure Domination Number of a Graph.

S. V. Divya Rashmi, A. Somasundaram, S. Arumugam

Electron. Notes Discret. Math., 2016

Minimizing the Number of Exceptional Edges in Cellular Manufacturing Problem.

S. Arumugam, J. Saral, A. Somasundaram

Electron. Notes Discret. Math., 2016

Bounds on Graphoidal Length of a Graph.

S. Arumugam, Purnima Gupta, Rajesh Singh

Electron. Notes Discret. Math., 2016

Characterizing minimal point set dominating sets.

Purnima Gupta, Rajesh Singh, S. Arumugam

AKCE Int. J. Graphs Comb., 2016

Signed Cycle Domination in Planar Graphs.

M. Sundarakannan, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Independent Resolving Number of Convex Polytopes.

B. Suganya, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Statistical Approach to Trace the Source of Attack Based on the Variability in Data Flows.

T. Subburaj, K. Suthendran, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Global Secure Domination in Graphs.

S. V. Divya Rashmi, S. Arumugam, A. Somasundaram

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

An Overview of the MapReduce Model.

S. Rajeswari, K. Suthendran, K. Rajakumar, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Identification of Salinity Stress Tolerant Proteins in Sorghum Bicolor Computational Approach.

S. Rajeswari, M. Indhumathy, A. Somasundaram, Neeru Sood, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars.

M. Nalliah, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Upper Majority Domination Number of a Graph.

A. Muthuselvi, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

A Novel Reversible Data Hiding Method in Teleradiology to Maximize Data Capacity in Medical Images.

S. Fepslin Athish Mon, K. Suthendran, K. Arjun, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Mixed Noise Elimination and Data Hiding for Secure Data Transmission.

P. Mohanakrishnan, K. Suthendran, S. Arumugam, T. Panneerselvam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Distance Antimagic Labelings of Graphs.

Nainarraj Kamatchi, Gurusamy Rengasamy Vijayakumar, A. Ramalakshmi, S. Nilavarasi, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Dominator Coloring of Generalized Petersen Graphs.

J. Maria Jeyaseeli, Nazanin Movarraei, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Graphoidal Length and Graphoidal Covering Number of a Graph.

Purnima Gupta, Rajesh Singh, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

On Nearly Distance Magic Graphs.

Aloysius Godinho, Tarkeshwar Singh, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

Probabilistic Conjunctive Grammar.

K. Kanchan Devi, S. Arumugam

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

m-Gracefulness of Graphs.

Jessica Pereira, Tarkeshwar Singh, S. Arumugam

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

On Real-valued Visual Cryptographic Basis Matrices.

Neil Buckley, Atulya K. Nagar, Subramanian Arumugam

J. Univers. Comput. Sci., 2015

Vertex and Edge Dimension of Hypergraphs.

Martín Manrique, S. Arumugam

Graphs Comb., 2015

A New Measure for Gracefulness of Graphs.

Jessica Pereira, Tarkeshwar Singh, S. Arumugam

Electron. Notes Discret. Math., 2015

On (k, d)-Skolem Graceful Graphs.

Jessica Pereira, Tarkeshwar Singh, S. Arumugam

Electron. Notes Discret. Math., 2015

A note on Distance Magic and Distance antimagic graphs.

Nainarraj Kamatchi, A. Ramalakshmi, S. Nilavarasi, S. Arumugam

Electron. Notes Discret. Math., 2015

On S-Magic Graphs.

Aloysius Godinho, Tarkeshwar Singh, S. Arumugam

Electron. Notes Discret. Math., 2015

Vertex in-magic arc labelings of digraphs.

M. Balakrishnan, G. Marimuthu, S. Arumugam

Electron. Notes Discret. Math., 2015

New Classes of Graceful Unicyclic Graphs.

Jay S. Bagga, Laure Pauline Fotso, Pambe Biatch' Max, S. Arumugam

Electron. Notes Discret. Math., 2015

Super (a, d)-edge antimagic total labelings of friendship and generalized friendship graphs.

S. Arumugam, M. Nalliah

Electron. Notes Discret. Math., 2015

Preface.

S. Arumugam, Dalibor Froncek, Joe Ryan, Kiki Ariyanti Sugeng, Martin Baca, Mirka Miller

Electron. Notes Discret. Math., 2015

Resolving Sets without Isolated Vertices.

P. Jeya Bala Chitra, S. Arumugam

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Identification of Bottleneck Elements in Cellular Manufacturing Problem.

S. Arumugam, J. Saral

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Independent Dominator Sequence Number of a Graph.

S. Arumugam, B. Jayaram, Krishnaiyan Thulasiraman

Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

2014

On the uniqueness of <i>D</i>-vertex magic constant.

Subramanian Arumugam, Nainarraj Kamatchi, Gurusamy Rengasamy Vijayakumar

Discuss. Math. Graph Theory, 2014

On (k, n)*-visual cryptography scheme.

S. Arumugam, R. Lakshmanan, Atulya K. Nagar

Des. Codes Cryptogr., 2014

2013

Editorial.

S. Arumugam, William F. Smyth

J. Discrete Algorithms, 2013

Association Rule Mining using Path Systems in Directed Graphs.

Subramanian Arumugam, S. Sabeen

Int. J. Comput. Commun. Control, 2013

Graph access structures with optimal pixel expansion three.

S. Arumugam, R. Lakshmanan, Atulya K. Nagar

Inf. Comput., 2013

On fractional Metric Dimension of graphs.

S. Arumugam, Varughese Mathew, Jian Shen

Discret. Math. Algorithms Appl., 2013

Equality of domination and transversal numbers in hypergraphs.

S. Arumugam, Bibin K. Jose, Csilla Bujtás, Zsolt Tuza

Discret. Appl. Math., 2013

2012

Fractional distance domination in graphs.

S. Arumugam, Kalimuthu Karuppasamy, Varughese Mathew

Discuss. Math. Graph Theory, 2012

The fractional metric dimension of graphs.

S. Arumugam, Varughese Mathew

Discret. Math., 2012

Super (a, d)-edge antimagic total labelings of friendship graphs.

S. Arumugam, M. Nalliah

Australas. J Comb., 2012

On (a, d)-distance antimagic graphs.

S. Arumugam, Nainarraj Kamatchi

Australas. J Comb., 2012

Minimal dominating sets in maximum domatic partitions.

S. Arumugam, K. Raja Chandrasekar

Australas. J Comb., 2012

2011

Equitable domination in Graphs.

A. Anitha, S. Arumugam, Mustapha Chellali

Discret. Math. Algorithms Appl., 2011

Maximal independent sets in minimum colorings.

S. Arumugam, Teresa W. Haynes, Michael A. Henning, Yared Nigussie

Discret. Math., 2011

Algorithmic Aspects of Dominator Colorings in Graphs.

S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010

Fractional global domination in graphs.

S. Arumugam, Kalimuthu Karuppasamy, Ismail Sahul Hamid

Discuss. Math. Graph Theory, 2010

Irredundance saturation number of a graph.

S. Arumugam, Odile Favaron, S. Sudha

Australas. J Comb., 2010

2009

A Note On Global Domination In Graphs.

S. Arumugam, R. Kala

Ars Comb., 2009

2008

On Maximal Fractional Independent Sets In Graphs.

K. Reji Kumar, S. Arumugam, Gary MacGillivray

Ars Comb., 2008

2007

Fuzzy technique based recognition of handwritten characters.

R. M. Suresh, S. Arumugam

Image Vis. Comput., 2007

Total and connected domination in digraphs.

S. Arumugam, K. Jacob, Lutz Volkmann

Australas. J Comb., 2007

Simple acyclic graphoidal covers in a graph.

S. Arumugam, I. Sahul Hamid

Australas. J Comb., 2007

2006

Texture image segmentation using combined features from spatial and spectral distribution.

K. Muneeswaran, L. Ganesan, S. Arumugam, K. Ruba Soundar

Pattern Recognit. Lett., 2006

2005

Texture classification with combined rotation and scale invariant wavelet features.

K. Muneeswaran, L. Ganesan, S. Arumugam, K. Ruba Soundar

Pattern Recognit., 2005

A Novel Approach Combining Gabor Wavelet and Moments for Texture Segmentation.

K. Muneeswaran, L. Ganesan, S. Arumugam, P. Harinarayan

Int. J. Wavelets Multiresolution Inf. Process., 2005

2003

Asteroidal Chromatic Number of a Graph.

S. Arumugam, Hepzibai Jeyakumar

Electron. Notes Discret. Math., 2003

2000

BIONET: an artificial neural network model for diagnosis of diseases.

S. Thamarai Selvi, S. Arumugam, L. Ganesan

Pattern Recognit. Lett., 2000

Quantitative fuzzy measures for threshold selection.

K. Ramar, S. Arumugam, S. N. Sivanandam, L. Ganesan, D. Manimegalai

Pattern Recognit. Lett., 2000

1999

Maximum Size of a Connected Graph with Given Domination Parameters.

S. Arumugam, S. Velammal

Ars Comb., 1999

1996

On indexable graphs.

S. Arumugam, K. Augustine Germina

Discret. Math., 1996

Domination parameters of star graph.

S. Arumugam, R. Kala

Ars Comb., 1996