Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubramanian Arumugam 0001
S. Arumugam 0001
Person information
- affiliation: Ramco Institute of Technology, Rajapalyam, India
- affiliation: Kalasalingam University, Krishnankoil, India
Other persons with the same name
- Subramanian Arumugam 0002 (aka: Subi Arumugam) — University of Florida, Gainesville, USA
- Subramanian Arumugam 0003 — Vellore Institute of Technology (VIT), Chennai, India
- Subramanian Arumugam 0004 — Amrita Vishwa Vidyapeetham, Department of Electronics and Communication Engineering, Coimbatore, India
- S. Arumugam — disambiguation page
- S. Arumugam 0002
![[0000-0002-0233-3832]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-0233-3832")
— Directorate of Technical Education, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i2]Subramanian Arumugam, Suresh Manjanath Hegde, Shashanka Kulamarva:
An improved upper bound for the domination number of a graph. CoRR abs/2401.02765 (2024)- 2023
- [j72]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: 49-60 (2023) - [j71]Raksha Poojary, Arathi Bhat K., Subramanian Arumugam, Manjunatha Prasad Karantha:
Stress of a graph and its computation. AKCE Int. J. Graphs Comb. 20(2): 200-208 (2023) - [j70]Purnima Gupta, Alka Goyal, S. Arumugam:
Line-set domination in graphs. Discret. Math. Algorithms Appl. 15(5): 2250117:1-2250117:6 (2023) - 2022
- [j69]Rajesh Singh, Purnima Gupta, S. Arumugam:
Truly non-trivial graphoidal graphs. AKCE Int. J. Graphs Comb. 19(2): 112-117 (2022) - [j68]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): 159-165 (2022) - [j67]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): 2250004:1-2250004:8 (2022) - 2021
- [j66]B. Suganya, S. Arumugam:
Independent resolving sets in graphs. AKCE Int. J. Graphs Comb. 18(2): 106-109 (2021) - 2020
- [j65]Manju Raju, Kiran R. Bhutani, Babak Moazzez, S. Arumugam:
On -domination in graphs. AKCE Int. J. Graphs Comb. 17(1): 60-64 (2020) - [j64]Nainarraj Kamatchi, Krishnan Paramasivam, Appattu Vallapil Prajeesh, K. Muhammed Sabeel, S. Arumugam:
On group vertex magic graphs. AKCE Int. J. Graphs Comb. 17(1): 461-465 (2020) - [j63]S. Arumugam, Jay S. Bagga:
Preface. AKCE Int. J. Graphs Comb. 17(2): 637 (2020) - [j62]S. Arumugam, Jay S. Bagga:
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs. AKCE Int. J. Graphs Comb. 17(2): 660-664 (2020) - [j61]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): 673-678 (2020) - [j60]Purnima Gupta, Rajesh Singh, S. Arumugam:
Graphs with equal domination and independent domination numbers. AKCE Int. J. Graphs Comb. 17(2): 691-696 (2020) - [j59]Nancy Jaseintha Cutinho, S. Sudha, S. Arumugam:
Distance antimagic labelings of Cartesian product of graphs. AKCE Int. J. Graphs Comb. 17(3): 940-942 (2020) - [j58]S. Sudha, S. Arumugam:
Min-max and max-min graph saturation parameters. AKCE Int. J. Graphs Comb. 17(3): 943-947 (2020) - [j57]Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam:
Algorithmic complexity of secure connected domination in graphs. AKCE Int. J. Graphs Comb. 17(3): 1010-1013 (2020) - [j56]Jessica Pereira, Tarkeshwar Singh, S. Arumugam:
Edge consecutive gracefulness of a graph. Discret. Appl. Math. 280: 214-220 (2020) - [j55]Seena Varghese, S. Aparna Lakshmanan, Subramanian Arumugam:
Two classes of non-Leech trees. Electron. J. Graph Theory Appl. 8(1): 205-210 (2020) - [i1]Jakkepalli Pavan Kumar, P. Venkata Subba Reddy, S. Arumugam:
Algorithmic Complexity of Secure Connected Domination in Graphs. CoRR abs/2002.00713 (2020)
2010 – 2019
- 2019
- [j54]S. V. Divya Rashmi, A. Somasundaram, S. Arumugam:
Secure domination subdivision number of a graph. Discret. Math. Algorithms Appl. 11(3): 1950036:1-1950036:11 (2019) - [j53]S. Arumugam, K. Raja Chandrasekar:
Linear time algorithm for dominator chromatic number of trestled graphs. Discret. Math. Algorithms Appl. 11(6): 1950066:1-1950066:8 (2019) - 2018
- [j52]Subramanian Arumugam, Aloysius Godinho, Tarkeshwar Singh:
The distance magic index od a graph. Discuss. Math. Graph Theory 38(1): 135-142 (2018) - 2017
- [j51]Deepti Jain, Purnima Gupta, S. Arumugam:
Minimal 2-point set dominating sets of a graph. AKCE Int. J. Graphs Comb. 14(2): 135-141 (2017) - [j50]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): 172-177 (2017) - [j49]R. Lakshmanan, S. Arumugam:
Construction of a (k, n)-visual cryptography scheme. Des. Codes Cryptogr. 82(3): 629-645 (2017) - [j48]Subramanian Arumugam, K. Premalatha, Martin Baca, Andrea Semanicová-Fenovcíková:
Local Antimagic Vertex Coloring of a Graph. Graphs Comb. 33(2): 275-285 (2017) - [j47]B. Jayaram, S. Arumugam, Krishnaiyan Thulasiraman:
Dominator sequences in bipartite graphs. Theor. Comput. Sci. 694: 34-41 (2017) - [e2]S. Arumugam, Jay S. Bagga, Lowell W. Beineke, B. S. Panda:
Theoretical Computer Science and Discrete Mathematics - First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10398, Springer 2017, ISBN 978-3-319-64418-9 [contents] - 2016
- [j46]Purnima Gupta, Rajesh Singh, S. Arumugam:
Characterizing minimal point set dominating sets. AKCE Int. J. Graphs Comb. 13(3): 283-289 (2016) - [j45]S. Arumugam, Purnima Gupta, Rajesh Singh:
Bounds on Graphoidal Length of a Graph. Electron. Notes Discret. Math. 53: 113-122 (2016) - [j44]S. V. Divya Rashmi, A. Somasundaram, S. Arumugam:
Upper Secure Domination Number of a Graph. Electron. Notes Discret. Math. 53: 297-306 (2016) - [j43]S. Arumugam, J. Saral, A. Somasundaram:
Minimizing the Number of Exceptional Edges in Cellular Manufacturing Problem. Electron. Notes Discret. Math. 53: 465-472 (2016) - [j42]Neil Buckley, Atulya K. Nagar, Subramanian Arumugam:
On the use of secret sharing as a secure multi-use pad. Innov. Syst. Softw. Eng. 12(3): 215-225 (2016) - [j41]S. Arumugam, Kiran R. Bhutani, L. Sathikala:
On (r, s)-Fuzzy Domination in Fuzzy Graphs. New Math. Nat. Comput. 12(1): 1-10 (2016) - [c21]Jessica Pereira, Tarkeshwar Singh, S. Arumugam:
m-Gracefulness of Graphs. CALDAM 2016: 289-298 - [c20]S. V. Divya Rashmi, S. Arumugam, A. Somasundaram:
Global Secure Domination in Graphs. ICTCSDM 2016: 50-54 - [c19]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: 55-62 - [c18]Aloysius Godinho, Tarkeshwar Singh, S. Arumugam:
On Nearly Distance Magic Graphs. ICTCSDM 2016: 76-82 - [c17]Nainarraj Kamatchi, Gurusamy Rengasamy Vijayakumar, A. Ramalakshmi, S. Nilavarasi, S. Arumugam:
Distance Antimagic Labelings of Graphs. ICTCSDM 2016: 113-118 - [c16]K. Kanchan Devi, S. Arumugam:
Probabilistic Conjunctive Grammar. ICTCSDM 2016: 119-127 - [c15]J. Maria Jeyaseeli, Nazanin Movarraei, S. Arumugam:
Dominator Coloring of Generalized Petersen Graphs. ICTCSDM 2016: 144-151 - [c14]P. Mohanakrishnan, K. Suthendran, S. Arumugam, T. Panneerselvam:
Mixed Noise Elimination and Data Hiding for Secure Data Transmission. ICTCSDM 2016: 156-164 - [c13]A. Muthuselvi, S. Arumugam:
Upper Majority Domination Number of a Graph. ICTCSDM 2016: 197-202 - [c12]M. Nalliah, S. Arumugam:
Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars. ICTCSDM 2016: 203-211 - [c11]Purnima Gupta, Rajesh Singh, S. Arumugam:
Graphoidal Length and Graphoidal Covering Number of a Graph. ICTCSDM 2016: 305-311 - [c10]S. Rajeswari, K. Suthendran, K. Rajakumar, S. Arumugam:
An Overview of the MapReduce Model. ICTCSDM 2016: 312-317 - [c9]S. Rajeswari, M. Indhumathy, A. Somasundaram, Neeru Sood, S. Arumugam:
Identification of Salinity Stress Tolerant Proteins in Sorghum Bicolor Computational Approach. ICTCSDM 2016: 318-325 - [c8]T. Subburaj, K. Suthendran, S. Arumugam:
Statistical Approach to Trace the Source of Attack Based on the Variability in Data Flows. ICTCSDM 2016: 392-400 - [c7]B. Suganya, S. Arumugam:
Independent Resolving Number of Convex Polytopes. ICTCSDM 2016: 401-408 - [c6]M. Sundarakannan, S. Arumugam:
Signed Cycle Domination in Planar Graphs. ICTCSDM 2016: 409-414 - 2015
- [j40]S. Arumugam, Dalibor Froncek, Joe Ryan, Kiki Ariyanti Sugeng, Martin Baca, Mirka Miller:
Preface. Electron. Notes Discret. Math. 48: 1 (2015) - [j39]Jay S. Bagga, Laure Pauline Fotso, Pambe Biatch' Max, S. Arumugam:
New Classes of Graceful Unicyclic Graphs. Electron. Notes Discret. Math. 48: 27-32 (2015) - [j38]M. Balakrishnan, G. Marimuthu, S. Arumugam:
Vertex in-magic arc labelings of digraphs. Electron. Notes Discret. Math. 48: 33-39 (2015) - [j37]Jessica Pereira, Tarkeshwar Singh, S. Arumugam:
On (k, d)-Skolem Graceful Graphs. Electron. Notes Discret. Math. 48: 81-88 (2015) - [j36]S. Arumugam, M. Nalliah:
Super (a, d)-edge antimagic total labelings of friendship and generalized friendship graphs. Electron. Notes Discret. Math. 48: 103-110 (2015) - [j35]Nainarraj Kamatchi, A. Ramalakshmi, S. Nilavarasi, S. Arumugam:
A note on Distance Magic and Distance antimagic graphs. Electron. Notes Discret. Math. 48: 183-187 (2015) - [j34]Aloysius Godinho, Tarkeshwar Singh, S. Arumugam:
On S-Magic Graphs. Electron. Notes Discret. Math. 48: 267-273 (2015) - [j33]Jessica Pereira, Tarkeshwar Singh, S. Arumugam:
A New Measure for Gracefulness of Graphs. Electron. Notes Discret. Math. 48: 275-280 (2015) - [j32]Martín Manrique, S. Arumugam:
Vertex and Edge Dimension of Hypergraphs. Graphs Comb. 31(1): 183-200 (2015) - [j31]Neil Buckley, Atulya K. Nagar, Subramanian Arumugam:
On Real-valued Visual Cryptographic Basis Matrices. J. Univers. Comput. Sci. 21(12): 1536-1562 (2015) - [c5]P. Jeya Bala Chitra, S. Arumugam:
Resolving Sets without Isolated Vertices. ICGTIS 2015: 38-42 - [c4]S. Arumugam, B. Jayaram, Krishnaiyan Thulasiraman:
Independent Dominator Sequence Number of a Graph. ICGTIS 2015: 43-46 - [c3]S. Arumugam, J. Saral:
Identification of Bottleneck Elements in Cellular Manufacturing Problem. ICGTIS 2015: 181-185 - 2014
- [j30]S. Arumugam, R. Lakshmanan, Atulya K. Nagar:
On (k, n)*-visual cryptography scheme. Des. Codes Cryptogr. 71(1): 153-162 (2014) - [j29]Subramanian Arumugam, Nainarraj Kamatchi, Gurusamy Rengasamy Vijayakumar:
On the uniqueness of D-vertex magic constant. Discuss. Math. Graph Theory 34(2): 279-286 (2014) - 2013
- [j28]S. Arumugam, Bibin K. Jose, Csilla Bujtás, Zsolt Tuza:
Equality of domination and transversal numbers in hypergraphs. Discret. Appl. Math. 161(13-14): 1859-1867 (2013) - [j27]S. Arumugam, Varughese Mathew, Jian Shen:
On fractional Metric Dimension of graphs. Discret. Math. Algorithms Appl. 5(4) (2013) - [j26]S. Arumugam, R. Lakshmanan, Atulya K. Nagar:
Graph access structures with optimal pixel expansion three. Inf. Comput. 230: 67-75 (2013) - [j25]Subramanian Arumugam, S. Sabeen:
Association Rule Mining using Path Systems in Directed Graphs. Int. J. Comput. Commun. Control 8(6): 791-799 (2013) - [j24]S. Arumugam, William F. Smyth:
Editorial. J. Discrete Algorithms 23: 1 (2013) - 2012
- [j23]S. Arumugam, K. Raja Chandrasekar:
Minimal dominating sets in maximum domatic partitions. Australas. J Comb. 52: 281-292 (2012) - [j22]S. Arumugam, M. Nalliah:
Super (a, d)-edge antimagic total labelings of friendship graphs. Australas. J Comb. 53: 237-244 (2012) - [j21]S. Arumugam, Nainarraj Kamatchi:
On (a, d)-distance antimagic graphs. Australas. J Comb. 54: 279-288 (2012) - [j20]S. Arumugam, Varughese Mathew:
The fractional metric dimension of graphs. Discret. Math. 312(9): 1584-1590 (2012) - [j19]S. Arumugam, Kalimuthu Karuppasamy, Varughese Mathew:
Fractional distance domination in graphs. Discuss. Math. Graph Theory 32(3): 449-459 (2012) - [e1]S. Arumugam, W. F. Smyth:
Combinatorial Algorithms, 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7643, Springer 2012, ISBN 978-3-642-35925-5 [contents] - 2011
- [j18]S. Arumugam, Teresa W. Haynes, Michael A. Henning, Yared Nigussie:
Maximal independent sets in minimum colorings. Discret. Math. 311(13): 1158-1163 (2011) - [j17]A. Anitha, S. Arumugam, Mustapha Chellali:
Equitable domination in Graphs. Discret. Math. Algorithms Appl. 3(3): 311-322 (2011) - [c2]S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip, Saket Saurabh:
Algorithmic Aspects of Dominator Colorings in Graphs. IWOCA 2011: 19-30 - 2010
- [j16]S. Arumugam, Odile Favaron, S. Sudha:
Irredundance saturation number of a graph. Australas. J Comb. 46: 37-50 (2010) - [j15]S. Arumugam, Kalimuthu Karuppasamy, Ismail Sahul Hamid:
Fractional global domination in graphs. Discuss. Math. Graph Theory 30(1): 33-44 (2010)
2000 – 2009
- 2009
- [j14]S. Arumugam, R. Kala:
A Note On Global Domination In Graphs. Ars Comb. 93 (2009) - 2008
- [j13]K. Reji Kumar, S. Arumugam, Gary MacGillivray:
On Maximal Fractional Independent Sets In Graphs. Ars Comb. 87 (2008) - 2007
- [j12]S. Arumugam, I. Sahul Hamid:
Simple acyclic graphoidal covers in a graph. Australas. J Comb. 37: 243-256 (2007) - [j11]S. Arumugam, K. Jacob, Lutz Volkmann:
Total and connected domination in digraphs. Australas. J Comb. 39: 283-292 (2007) - [j10]R. M. Suresh, S. Arumugam:
Fuzzy technique based recognition of handwritten characters. Image Vis. Comput. 25(2): 230-239 (2007) - 2006
- [j9]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): 755-764 (2006) - 2005
- [j8]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): 559-572 (2005) - [j7]K. Muneeswaran, L. Ganesan, S. Arumugam, K. Ruba Soundar:
Texture classification with combined rotation and scale invariant wavelet features. Pattern Recognit. 38(10): 1495-1506 (2005) - 2003
- [j6]S. Arumugam, Hepzibai Jeyakumar:
Asteroidal Chromatic Number of a Graph. Electron. Notes Discret. Math. 15: 241-243 (2003) - [c1]R. M. Suresh, S. Arumugam:
Fuzzy Technique Based Recognition of Handwritten Characters. WILF 2003: 297-308 - 2000
- [j5]K. Ramar, S. Arumugam, S. N. Sivanandam, L. Ganesan, D. Manimegalai:
Quantitative fuzzy measures for threshold selection. Pattern Recognit. Lett. 21(1): 1-7 (2000) - [j4]S. Thamarai Selvi, S. Arumugam, L. Ganesan:
BIONET: an artificial neural network model for diagnosis of diseases. Pattern Recognit. Lett. 21(8): 721-740 (2000)
1990 – 1999
- 1999
- [j3]S. Arumugam, S. Velammal:
Maximum Size of a Connected Graph with Given Domination Parameters. Ars Comb. 52 (1999) - 1996
- [j2]S. Arumugam, R. Kala:
Domination parameters of star graph. Ars Comb. 44 (1996) - [j1]S. Arumugam, K. Augustine Germina:
On indexable graphs. Discret. Math. 161(1-3): 285-289 (1996)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-02 22:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
