Publications



Books:


  1. Modern Algebra
  2. Modern Analysis
  3. Sequences and Series
  4. Calculus Vol.1
  5. Calculus Vol.2
  6. Analytical Geometry
  7. Differential Equations and Its Applications
  8. Set Theory, Number System and Theory of Equations
  9. Statistics
  10. Complex Analysis
  11. Ancillary Mathematics (four volumes)
  12. Analytical Geometry 3D and Vector Calculus
  13. Trigonometry and Fourier Series
  14. Invitation to Graph Theory
  15. Engineering Mathematics Vol.1
  16. Engineering Mathematics Vol.2
  17. Engineering Mathematics Vol.3
  18. Numerical Methods
  19. Two Tamil Medium text books on Graph Theory and Programming in C respectively
  20. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms, CRC Press

Most of these books are prescribed as text books by the Boards of Studies for the undergraduate courses in various universities and autonomous colleges throughout Tamil Nadu,India.


Journal Publications:


1984

  1. Subbulakshmi S Rajan and S. Arumugam, On forcibly unilaterally connected acyclic digraphic sequences, The Mahematics Student, 52 (1984), 251-252.
  2. Subbulakshmi S Rajan and S. Arumugam, On forcibly disconnected acyclic graphic sequences, The Mathematics Student, 52 (1984), 242-244.
1985

  1. S. Arumugam, On topological projective planes-I, Publ. Math. Debrecen 32 (1985), 251-253.
1986

  1. S. Arumugam, On topological projective planes-II, Indian J.pure appl. Math. 17 (11) (1986), 1314-1316.
  2. S. Arumugam, Topological projective planes, Kyungpook Math. J. 26 (1986), 217-222.
1988

  1. S. Arumugam and P. Venuvanalingam, Calculation of MO energy levels of conjugated systems using graph theory, Chemistry Education 5 (1) (1988), 14-17.
1989

  1. C. Pakkiam and S. Arumugam, On the graphoidal covering number of a graph, Indian J.pure appl. Math. 20 (4) (1989), 330-333.
  2. S. Arumugam, On topological projective planes III, Indian J. pure appl. Math, 20 (11) (1989), 1115-1118.
1990
  1. C. Pakkiam and S. Arumugam, On graphoidal graphs of a tree, Indian J. pure appl. Math. 21(12) (1990), 1055-1058.
1991
  1. S. Arumugam, A note on topological projective planes, Indian J. pure appl. Math, 22 (1) (1991), 83-84.
  2. N. Veerapandian and S. Arumugm, On Balanced graphs, Ars Combinatoria, 32 (1991), 221-223.
  3. N. Veerapandian, P.N. Ramachandran and S. Arumugam, On k-balanced graphs, J.Ramanujan Math. Soc. 6 (1991), 1-8.
1992
  1. J. Paulraj Joseph and S. Arumugam On connected cutfree domination in graphs, Indian J. pure appl. Math. 23 (9) (1992), 643-647.
  2. C. Pakkiam and S. Arumugam, The graphoidal covering number of unicyclic graphs, Indian J.pure appl.Math. 23 (2) (1992), 141-143.
  3. J. Paulraj Joseph and S. Arumugam, Domination and connectivity in graphs, International Journal of Management and Systems 8 (1992), 233-236.
  4. S. Arumugam, Topological projective planes, Symposium on Trends in Algebra and Topology-1992 Madurai Kamaraj University technical Report, (1992), 81-86.
1994
  1. S. Arumugam and C. Pakkiam, Graphs with unique minimum Graphoidal cover, Indian J. pure. Appl. Math., 25(11) (1994), 1147-1153.
  2. S. Arumugam and C. Pakkiam, The graphoidal covering number of hypergraphs, International Journal of Management and Systems 10 (1994), 195-200.
  3. J. Paulraj Joseph and S.Arumugam, On the Connected domatic number of a graph. J. Ramanujan Math Soc. 9 (1994), 69-77.
  4. S. Arumugam and C. Pakkiam, Graphoidal bipartite graphs, Graphs and Combinators. 10(1994), 305-310.
1995
  1. S. Arumugam and J. Paulraj Joseph, Uniform domination in graphs, International Journal of Management and Systems, 11 (1995), 111-116.
  2. S. Arumugam, Domination in graphs-recent developments and some open problems, in Recent Trends in Mathematics, Ed. M.L. Santiago (1995), 26-33.
  3. S. Arumugam and C. Pakkiam, Graphoidal covering number of digraphs, Journal of Mathematical and Physical Sciences, 29 (1995), 33-41.
  4. S. Arumugam and J. Paulraj Joseph, Domination in graphs, International Journal of Management and Systems, 11 (1995), 177-182.
1996
  1. J. Paulraj Joseph and S. Arumugam, On 2-edge connected domination in graphs, International Journal of Management and Systems, 12(2) (1996), 131-138.
  2. S. Arumugam and J. Paulraj Joseph, Domination in subdivision graphs, J.Indian Math. Soc., 62 (1996), 274-282.
  3. S. Arumugam and A. Thuraiswamy, Total domination in graphs, Ars Combinatoria, 43 (1996) 89-92.
  4. S. Arumugam and R. Kala, Domination parameters of star graph, Ars Combinatoria, 44 (1996), 93-96.
  5. S. Arumugam and K. A. Germina, Note On indexable graphs, Discrete Mathematics, 161 (1996), 285-289.
1997
  1. S. Arumugam, Indra Rajasingh, R. Bharathi and Roushini Leely Pushpam, On graphs whose graphoidal covering number is one less than its cyclomatic number, Proceedings of the National workshop on Graph Theory and Its Applications, Manonmaniam Sundaranar University, Tirunelveli, 1996, Eds. S. Arumugam, B.D. Acharya and E.Sampathkumar, Tata McGraw Hill, New Delhi (1997), 29-34.
  2. S. Arumugam , B.D. Acharya and E.Sampathkumar, Graphoidal covers of graph- A creative review, in Proceedings of the National Workshop on Graph Theory and Its Applications, Manonmaniam Sundaranar University, Tirunelveli, 1996, Eds S. Arumugam, B.D. Acharya and E.Sampahkumar, Tata McGraw Hill,New Delhi (1997), 1-28.
  3. C. Xavier, S. Arumugam and S.P. Victor, Algorithmic aspects of symmetric dihypergraphs, Computer Science and Informatics 27(2) (1997) 26-31.
1998
  1. S. Arumugam and R.Kala, Domination parameters of hypercubes, J. Indian Math Soc., 65(1998), 31-38.
  2. S. Arumugam and S. Velammal, Edge domination in graphs, Taiwanese Journal of Mathematics, 2 (2) (1998), 173-179.
  3. S. Arumugam and J. Suresh Suseela, Acyclic graphoidal covers and path partitions in a graph, Discrete Mathematics, 190 (1998), 67-77.
  4. S. Arumugam and A. Thuraiswamy, Total domatic number of a graph I, Indian J.pure appl. Math., 29 (5) (1998), 513-515.
  5. S. Arumugam and S. Meena, Graphs that are randomly packable by some common disconnected graphs, Indian J.pure appl. Math, 29 (11) (1998) 1129-1136.
  6. R.M. Suresh and S.Arumugam, Fuzzy context-free grammar for handwritten numeral recognition, IT for the new generation, Proceedings of XXXIII Annual Convention of the Computer Society of India, Eds. J.R. Isaac and Harita Gupta, Tata McGraw Hill (1998), 411-419.
1999
  1. S. Arumugam and S.Velammal, Maximum size of a connected graph with given domination parameters, Ars Combinatoria, 52 (1999), 221-227.
  2. S. Arumugam and J. Paulraj Joseph, On graphs with equal domination and connected domination numbers, Discrete Mathematics, 206 (1999), 45-49.
  3. J. Paulraj Joseph and S. Arumugam, Domination and colouring in graphs, International Journal of Management and Systems, 15(1) (1999), 37-44.
  4. S. Arumugam and J. Suresh Suseela, Acyclic graphoidal covering number of digraphs, Proceedings of the Conference on Graph Connections, Cochin University of Science and Technology, Eds. A.Vijayakumar et al. Allied Publishers, (1999), 72-78.
  5. R.M. Suresh, S.Arumugam and L.Ganesan, Fuzzy approach to recognize Handwritten Tamil Characters, International Conference on Computational Intelligence and multimedia Applications (1999), Ed. Brijesh Verma Henry Selvaraj, Andre de Carvaho and Xin Yao, IEEE Computer Society (1999) ,459-463.
  6. R.M. Suresh, S. Arumugam and L. Ganesan, Handwritten characters recognition using Finite Fuzzy Automata, Information Technology for Computer Innovation CSI 1999 Annual Convention Proceedings Ed. S.P. Mudur, Tata McGraw Hill (1999), 62-73.
  7. S. Arumugam and R. Kala, Completeness of Domination Parameters, Proceedings of the conference on Graph Connections, Cochin University of Science and Technology Eds.A.Vijayakumar et al Allied Publishers (1999), 67-71.
  8. S.Arumugam, On three domination related parameters of a graph, Proceedings of the Conference on Graph connections, Cochin University of Science and Technology Eds. A. Vijayakumar et al, Allied Publishers (1999), 41-43.
  9. A.P. Santha Kumaran and S. Arumugam, The sequence Space Sp, Bulletin of Pure and Applied Sciences ,18 (1999), 53-58.
  10. S. Arumugam, Difference Labelings and Common weight Decompositions of Graphs, Technical Proceedings of Group discussions on Graph Labeling problems Ed. B.D. Acharya and S.M. Hegde, (1999),15-19.
2000
  1. R.S. Rajesh, S.Arumugam and S.Arumugam, Resource Deadlock Free Wormhole Multicast Routing Algorithm for Directed Networks, Proceedings of the International Conference on Advances in Mathematical Sciences 2000, Narosha Publishing House, (2000), 359-366.
  2. S. Arumugam and J. Suresh Suseela, On Graphoidal graphs, Journal of Discrete Mathematical Sciences and Cyptography, 3 (2000) 131-137.
2001
  1. S. Arumugam, Indra Rajasingh and Roushini Lily Pushpam, Note Graphs whose acyclic graphoidal covering number is one less than its maximum degree, Discrete Math, 240 (2001) 231-237.
  2. R.S. Rajesh, S. Arumugam and S. Arumugam, A dual step multicast wormhole routing algorithm for two dimensional mesh network, Proceedings of the twentyfifth National Systems Conference (NSC 2001) 328-331.
  3. J. Suresh Kumar and S. Arumugam, On ?- chromatic number of graphs, Proceedings of the National Conference on Mathematical and Computational models, (2001), 287-292.
2002
  1. S. Arumugam and R. Kala, Domsaturation number of a graph, Indian J.Pure appl. Math., 33 (11) (2002)1671-1676.
  2. S. Arumugam, Indra Rajasingh and Roushini Leely Pushpam, A Note on the Graphoidal Covering Number of a Graph, Journal of Discrete Mathematical Sciences and Cryptography, 5(2) (2002) 145-150.
  3. A.P. Santha Kumaran and S. Arumugam, Centrality with respect to Cliques, International Journal of Management and Systems, 18(3) (2002), 275-280.
2003
  1. S. Arumugam, Path Decomposition in Graphs-A Survey, Proceedings of KMA National Seminar on Discrete Mathematics and Applications, (2003) 45-54.
  2. S. Arumugam, Indra Rajasingh and Roushini Leely Pushpam, Characterization of a Class of Graphs with Unique Minimum Graphoidal Cover, Tamkang Journal of Mathematics, 34 (4) (2003), 317-325.
  3. S. Arumugam and H. Jeyakumar, Asteroidal Chromatic Number of a Graph, Electronic Notes Discrete Math., 15(2003), 241-243.
2004
  1. S. Arumugam, Indra Rajasingh and Roushini Leely Pushpam, On Graphs Whose Acyclic Graphoidal Covering Number Is One Less than Its Cyclomatic Number, Ars Combinatoria, Vol 72(2004), 255-261.
  2. S. Arumugam, Indra Rajasingh and P. Roushini Leely Pushpam, Graphs with unique minimum acyclic Graphoidal cover-I, Journal of Discrete Mathematical Sciences and Cryptography, 7(2) (2004), 179-186.
  3. S. Arumugam and R. Kala, Connected domsaturation number of a graph Indian. J. pure appl. Math., 35(10) (2004), 1215-1221.
2005
  1. S. Arumugam and G.R. Vijayakumar, Graphs with size equal to order plus graphoidal covering number, Graphs, Combinatorics, Algorithms and Applications Ed S. Arumugam, B.D. Acharya and S.B. Rao. Narosa Publishing House, (2005), 1-3.
  2. K. Jacob and S. Arumugam, Domatic Number of a Digraph, Bulletin of the Kerala Mathematical Association, 2(1) (2005), 93-103.
  3. K. Muneeswaran, L. Ganesan, S. Arumugam and K. Ruba Soundar, Texture classification with combined rotation and scale invariant wavelet features, Pattern Recognition, 38(2005), 1495-1506.
  4. T. Jebarajan, S. Arumugam and M. Abdul Majeed, Multimedia Congestion Control Protocol, Proceeding of the International Conference on Emerging Adaptive Systems and Technologies (EAST-2005), (2005), 747-777.
  5. S. Arumugam, Domination Related Functions in Graphs, Proceedings of the third National Conference on Mathematical and Computational Models (NCMCM-2005) Ed. R. Arumuganathan and R. Nadarajan , (2005), 81-90.
  6. K. Muneeswaran, L. Ganesan, S. Arumugam and P. Harinarayan, A Novel Approach Combining Gabor Wavelet and Moments for Texture Segmentation, International Journal of Wavelets, Multiresolution and Information Processing, 3(4) (2005), 559-572.
  7. S. Arumugam, T. Jebarajan and Gladrene Sheena Basil, Congestion Control for Real-Time Multimedia Streaming, Proceedings of the First National Conference on Emerging Technologies in Electrical Systems (ETES-2005), 1-9.
  8. S. Arumugam and J. Suresh Suseela Geodesic Graphoidal covering number of a graph J. Indian. Math. Soci., 72(2005), 99-106.
  9. S. Arumugam and S. Meena, Difference Labellings and Common-Weight Decompositions of Graphs, The Mathematics Student, 74(1-4)(2005), 217-223.
  10. K.G Srinivasagan, L. Ganesan and S. Arumugam, Tamil Hand Written Recognition Using Crucial Combination, Indian Journal of Information Science & Technology, 1(1) (2005), 1-9.
2006
  1. S. Arumugam and Hepzibai Jeyakumar, Asteroidal Sets In Trees And Unicyclic Graphs, International Journal of Management and Systems, 22(2) (2006), 189-196.
  2. R. M. Suresh, S. Arumugam: Fuzzy Technique Based Recognition of Handwritten Characters, V. Di Gesu, F. Masulli, and A. Petrosino (Eds.): WILF 2003, LNAI 2955, Springer-Verlag Berlin Heidelberg 2006, 297-308.
  3. K. Muneeswaran, L. Ganesan, Ruba Soundar and S. Arumugam, Frequency Domain Representation of Orthogonal Wavelet Packets for Face Recognition, Proceedings of International Conference on Resource Utilisation and Intelligent Systems, Kongu Engg., College, (2006), 846-849.
  4. Varsha George, T. Jebarajan and S. Arumugam, Congestion Control Mechanisms in IP-based CDMA Radio Access Networks and its Impacts, Proceedings of the National Conference on Advanced Computing -06, MIT, Chennai (2006), 101-107.
  5. Varsha George, T. Jebarajan and S. Arumugam, Impact of Congestion in IP-Based CDMA Radio Access Networks and its Control Mechanisms, Proceedings of International Conference on Recent trends in Information Systems (IRIS’06), National Engineering College, Kovilpatti, (2006), 214-225.
  6. S.P. Victor, C. Xavier and S. Arumugam, Parallel Algorithm to find a weighted core of a tree, JCS, 1(4)(2006), 287-292.
  7. S. Arumugam and R. Kala, Menger Sets in Graphs, Indian Journal of Mathematics, 48(3)(2006), 359-372.
  8. K. Muneeswaran, L. Ganesan, S. Arumugam and K. Ruba Soundar, Texture image segmentation using combined features from spatial and spectral distribution, Pattern Recognition Letters, 27(7) (2006), 755-764.
  9. K.G. Srinivasagan, L. Ganesan, S. Arumugam and K. Ramar, A Novel Tamil handwritten word Recognition using Hybrid Features, Proc. 3rd International Symposium on Management Engineering (ISME 2006), 2006.
  10. K.G Srinivasagan, L. Ganesan and S. Arumugam, Tamil Handwritten word Recognition using fuzzy values, 4th FAE International Symposium 2006, Europeen University of Legke, Turkey.
  11. K.G Srinivasagan, L. Ganesan and S. Arumugam, HMM based Tamil Handwritten Character Recognition, 4th FAE International Symposium 2006, Europeen University of Legke, Turkey.
2007
  1. B. Sankara Gomathi, L. Ganesan and S. Arumugam, Architecture proposed for new method of partitioning high speed fractional image compression, Journal of Engineering and Applied Sciences 2(3)(2007), 558-563.
  2. S. Arumugam and I. Sahul Hamid, Simple Acyclic Graphoidal covers in a graph, Australasian Journal of Combinatorics, 37(2007), 243-255.
  3. R.N. Ashlin Deepa , R. Subramanian, S. Arumugam, Recognition of Handwritten Characters through Multiset of Puzzle Pieces, Proceedings of the Third National Conference on Advanced Image processing and Networking, National Engineering College, Kovilpatti, 2007, 595-603.
  4. S. Arumugam and I. Sahul Hamid, Graphs with unique minimum simple graphoidal cover, Indian Journal of Mathematics 49(2)(2007), 151-163.
  5. R.M. Suresh and S. Arumugam, Fuzzy technique based recognition of handwritten characters, Image and Vision Comput., 25(2) (2007), 230-239.
  6. S. Arumugam and M. Subramanian, Edge Subdivision and Independence Saturation In A Graph, Graph Theory Notes of New York, LII (2007), 9-12.
  7. B. Sankaragomathi, L. Ganesan and S. Arumugam, Fractal Image Compression Applied to Remote Sensing, Proc. XXI. Internatinal Conference on Computer, Electrical and System Science and Engineering, 2007 (CESSE 2007), 386-391.
  8. S. Arumugam, K. Jacob and Lutz Volkmann, Total and Connected domination in digraphs, Australasian Journal of Combinatorics, 39(2007), 283-292.
  9. S. Arumugam and K. Rejikumar, Fractional Independence and Fractional Domination Chain in Graphs, AKCE. J. Graphs. Combin., 4(2)(2007), 161-169.
  10. S. Arumugam and M. Subramanian, Independence Saturation and Extended Domination Chain in Graphs, AKCE. J. Graphs. Combin., 4(2)(2007), 171-181.
  11. B.D. Acharya, S. Arumugam and P.J. Slater, Domination in Discrete Structures - New Directions, AKCE. J. Graphs. Combin., 4(2)(2007),113-115
  12. H. B. Walikar, B. D. Acharya, H. S. Ramane H. G. Shekharappa and S. Arumugam, Partially Balanced Incomplete Block Designs Arising From Minimal Dominating sets of a Graph, AKCE. J. Graphs. Combin., 4(2)(2007), 223-232.
  13. B. Sankaragomathi, L. Ganesan, S. Arumugam, Encoding Video Sequences in Fractional-Based Compression, Fractals, 15(4)(2007), 365-378.
  14. B. Sankara Gomathi, L. Ganesan and S. Arumugam, A practical approach to colour imaging compression using partitioned iterated function system, Advances in Modelling and Analysis B: Signals, Information, Patterns Data Acquisition, Transmision Processing and Classification, 50(1,2) (2007) 1-17.
  15. K.G Srinivasagan, L. Ganesan and S. Arumugam, Tamil Handwritten Word Recognizer, Advances in Modelling and Analysis B: Signals, Information, Patterns Data Acquisition, Transmision Processing and Classification,50(1,2) (2007), 64-77.
  16. K.G Srinivasagan, L. Ganesan and S. Arumugam, Hidden Markov Model based Tamil Handwritten Character Recognition, Advances in Modelling and Analysis B: Signals, Information, Patterns Data Acquisition, Transmision Processing and Classification,50(3,4) (2007), 1-14.
2008
  1. B. D. Acharya and S. Arumugam, Labelings of Discrete Structures – New Challenges, Labelings of Discrete Structures and Applications, Ed B. D. Acharya, S. Arumugam and A. Rosa. Narosa Publishing House, (2008), 1-14.
  2. B. D. Acharya, S. B. Rao and S. Arumugam Embeddings and NP-Complete problems for Graceful Graphs, Labelings of Discrete Structures and Applications, Ed. B. D. Acharya, S. Arumugam and A. Rosa, Narosa Publishing House, (2008), 57-62.
  3. S. Arumugam, A Note On Graceful Labelings and Graph Decomposition, Labelings of Discrete Structures and Applications, Ed. B. D. Acharya, S. Arumugam and A. Rosa, Narosa Publishing House, (2008), 63-68.
  4. S. Arumugam and S. Meena, Common Weight Decomposition Into Minimum Acyclic Graphoidal Covers, Labelings of Discrete Structures and Applications, Ed. B. D. Acharya, S. Arumugam and A. Rosa, Narosa Publishing House, (2008), 69-76.
  5. S. Arumugam and I. Sahul Hamid, Label Graphoidal Covering Number of a Graph, Labelings of Discrete Structures and Applications, Ed. B. D. Acharya, S. Arumugam and A. Rosa, Narosa Publishing House, (2008), 77-82.
  6. S. Arumugam and I. Sahul Hamid, Simple Graphoidal Covers in a Graph, J. Combin. Math. Combin. Comput., 64(2008), 79-95.
  7. S. Arumugam and Sithara Jerry, A note on independent domination in graphs, Bulletin of the Allahabad Mathematical Society, 23(1) (2008), 57-64.
  8. S. Arumugam, I. Sahul Hamid, Simple path covers in Graphs, International J. Math. Combin., 3(2008), 94-104.
  9. S. Arumugam, I. Sahul Hamid and A. Muthukamatchi, Independent Domination and Graph Colorings, Proc. of ICDM 2006, Ramanujan Mathematical Society Lecture Notes Series No. 7, 2008, 195-203.
  10. S. Arumugam and K. Reji Kumar, Basic Minimal Dominating Functions, Utilitas Math., 77 (2008), 235-247.
  11. B. Sankaragomathi, L. Ganesan and S. Arumugam, Performance of applying Fractal Coding on audio data, Int. J. Singnal and Imaging Systems Engineering, 1(3/4) (2008), 238-244
  12. S. Arumugam and J. Suresh Kumar, Tree t-spanners of a graph, J. of Combinatorics, Information and System Sciences, 33(3-4) (2008), 163-169.
  13. K. Reji Kumar, S. Arumugam and Gary MacGillivray, On Maximal Fractional Independent Sets In Graphs, Ars Combinatoria, 87(2008), 205-212.
  14. S. Arumugam and C. Sivagnanam, Neighborhood connected and neighborhood total domination in graphs. Proc. Int. Conf. on Disc. Math., (2008), 45-51.
  15. S. Arumugam, Coloring and Domination in Graphs, The Mathematics Student, 77(1-4)(2008), 119-129.
2009
  1. S. Arumugam, K.A. Germina and V. Ajitha, On (k,d) multiplicative indexable graphs, J. Combin.Math. Combin. Comput., 69(2009), 15-21.
  2. S. Arumugam, T.M.K. Anandavally, K.A. Germina and S.B. Rao, On sum composite graphs and embedding problems, J. Combin.Math. Combin. Comput., 69(2009), 23-30.
  3. S. Arumugam and Hebzibai Jeyakumar, Asteroidal Chromatic Number of a Graph, J. Combin.Math. Combin. Comput., 69(2009), 39-44.
  4. S. Arumugam and I. Sahul Hamid, Graphs with unique minimum simple acyclic graphoidal cover, J. Combin.Math. Combin. Comput., 69(2009), 45-52.
  5. V. Ajitha, S. Arumugam and K.A. Germina, On square sum graphs, AKCE. J. Graphs. Combin., 6(1) (2009), 1-10.
  6. S. Arumugam, G.S. Bloom, Mirka Miller and Joe Ryan, Some Open Problems on Graph Labelings, AKCE. J. Graphs. Combin., 6(1) (2009), 229-236.
  7. S. Arumugam, S. Velammal, Connected Edge domination in graphs, Bulletin of Allahabad mathematical Society, 24(1) (2009), 43-49.
  8. S. Arumugam and Sithara Jerry, Fractional Edge Domination in Graphs, Appl. Anal. Discrete Math.3(2009), 359-370.
  9. S. Arumugam and R. Kala, A Note on Global Domination in Graphs, Ars Combinatoria, 93(2009), 175-180
  10. A. Anitha, S. Arumugam and E. Sampathkumar, Degree Equitable Sets in a Graph, International J.Math. Combin., 3(2009), 32-47.
  11. S. Arumugam, K.A. Germina and T.M. K. Anandavally, On Additively Geometric Graphs, J. Combin. Math. Combin.Comput., 70 (2009), 207-216.
2010
  1. S. Arumugam, O. Favaron and S. Sudha, Irredundance Saturation Number of a Graph, Australasian Journal of Combinatorics, 46(2010), 37-49.
  2. S. Arumugam, K. Karuppasamy and I. Sahul Hamid, Fractional Global Domination in Graphs, Discussiones Mathematicae Graph Theory, 30(2010), 33-44.
  3. S. Arumugam and S. Sudha, Min-Max Dom-Saturation Number of a Tree, International J.Math. Combin., 2(2010), 45-52.
  4. A. P. Santhakumaran, S. Arumugam, Radius and Diameter with Respect to Cliques in Graphs, J. Combin. Matha.Combin.Comput., 72(2010), 231-241.
  5. S. Arumugam and C. Sivagnanam, Neighborhood Connected Domination in Graphs, J. Combin.Math. Combin. Comput., 73(2010), 55-64.
  6. S. Arumugam and Sithara Jerry, The convexity graph of minimal dominating functions of a graph, Proc. Jangjeon Math. Soc., 13 (2)(2010), 219-230.
  7. S. Arumugam and M. Sundarakannan, On k-Equivalence Dominating Sets in Graphs, International J.Math. Combin., 4 (2010), 86-93.
  8. L. Benedict Michaelraj, S.K. Ayyaswamy and S. Arumugam, Chromatic Transversal Domination in Graphs, J. Combin. Math. Combin. Comput., 75(2010), 33-40.
  9. A. Anitha, S. Arumugam, S.B. Rao and E. Sampathkumar, Degree Equitable Chromatic Number of a Graph, J. Combin. Math. Combin. Comput., 75(2010), 187-199.
  10. S. Arumugam and C. Sivagnanam, Neighborhood Connected Domatic Number of a Graph, J. Combin. Math. Combin. Comput., 75(2010), 239-249.
2011
  1. S. Arumugam, K. Raja Chandrasekar and S. Sudha, Irredundant and Open Irredundant Colorings of Graphs, Bulletin of the Institute of Combinatorics and Applications, 61(2011), 24-36.
  2. S. Arumugam, Teresa W. Haynes, Michael A. Henning and Yared Nigussie, Maximal Independent Sets in Minimum Colorings, Discrete Math., 311(2011), 1158-1163.
  3. S. Arumugam, Domination in Graphs, Graph Theory Research Directions, Eds. Pratima Panigrahi and S.B. Rao, Narosa Publishing House, (2011),35-47.
  4. S. Arumugam and C. Sivagnanam, Neighborhood Total Domination in Graphs, Opuscula Mathematica, 31(4) (2011), 519-531.
  5. A. Anitha, S. Arumugam and Mustapha Chellali, Equitable Domination in Graphs, Discrete Mathematics, Algorithms and Applications, 3(3)(2011), 311-321.
  6. S. Arumugam and Latha Martin, Degrees and Degree Sequence of k-edge d-critical graphs, Journal of Discrete Mathematical Sciences & Cryptography, 14(5) (2011), 421-429.
  7. S. Arumugam, K. Raja Chandrasekar, Neeldhara Misra, Geevarghese Philip and Saket Saurabh, Algorithmic Aspects of Dominator Colorings in Graphs, In IWOCA 2011, C.S. Iliopoulos and W.F. Smyth (Eds.), Springer-Verlag, Lecture Notes in Comput. Sci., 7056 (2011), 19-30.
  8. S. Arumugam and B. Vasanthi, Graph Theoretic Models for Social Networks- A Brief Survey, The Mathematics Student, 80 (1-4) (2011), 209-229.
  9. S. Arumugam and Jay Bagga, Graceful Labeling Algorithms and Complexity -A Survey, J. Indones. Math. Soc., Special Edition (2011), 1-9.
  10. S. Arumugam, Dalibor Froncek and N. Kamatchi, Distance Magic Graphs-A Survey, J. Indones. Math. Soc., Special Edition (2011), 11-26.
2012
  1. S. Arumugam, Metric Dimension in Graphs-A Brief Survey, Mathematical and Computational Models, Eds. R. Nadarajan, R.S. Lekshmi and G. Sai Sundara Krishnan, Narosa Publishing House, New Delhi, (2012), 318-325.
  2. S. Arumugam and K. Raja Chandrasekar, Minimal dominating sets in maximum domatic partitions, Australasian Journal of Combinatorics, 52 (2012), 281-292.
  3. S. Arumugam and Varughese Mathew, The Fractional Metric Dimension of Graphs, Discrete Math., 312(9) (2012), 1584-1590.
  4. S. Arumugam and M. Nalliah, Super (a,d)-edge antimagic total labelings of friendship graphs, Australasian Journal of Combinatorics, 53 (2012), 237-243.
  5. S. Arumugam, Varughese Mathew and K. Karuppasamy, Fractional Distance Domination in Graphs, Discussiones Mathematicae Graph Theory , 32 (2012), 449-459.
  6. S. Arumugam and M. Sundarakannan, The equivalence chain of a graph, J. Combin. Math. Combin. Comput., 80 (2012), 277-288.
  7. S. Arumugam and M. Sundarakannan, Equivalence domination number of a tree, Proc. Jangjeon Math. Soc., 15(3) (2012), 317-323.
  8. S. Arumugam and K. Raja Chandrasekar, A note on graphs with open irratic number two, Bulletin of ICA, 65 (2012), 27-32.
  9. S. Arumugam and N. Kamatchi, On (a, d)-distance antimagic graphs, Australasian Journal of Combinatorics, 54 (2012), 279-287.
  10. S. Arumugam, Jay Bagga and K. Raja Chandrasekar, On Dominator Colorings in Graphs, Proceedings Mathematical Sciences, 122(4) (2012), 561-571.
  11. S. Arumugam and K. Raja Chandrasekar, On Chromatic Transversal Domination in Graphs, J. Combin. Math. Combin. Comput.,83 (2012), 13-21.
  12. S. Arumugam and Sithara Jerry, The Convexity Graph of Minimal Total Dominating Functions of a Graph, Kragujevac J. Math. 36 (1) (2012), 119-131.
2013
  1. R. Anantha Kumar and S. Arumugam, Pairwise distance similar sets in graphs, J. Combin. Math. Combin. Comput., 84 (2013), 21-28.
  2. N. Kamatchi and S. Arumugam, Distance antimagic graphs, J. Combin. Math. Combin. Comput., 84 (2013), 61-67.
  3. R. Lakshmanan, S. Arumugam and Atulya K. Nagar, Visual cryptography scheme for the mindom access structure of a graph, J. Combin. Math. Combin. Comput., 84 (2013), 69-80.
  4. M. Nalliah and S. Arumugam, Super (a,d)-edge-antimagic total labelings of generalized friendship graphs, J. Combin. Math. Combin. Comput., 84 (2013), 81-90.
  5. S. Arumugam, R. Lakshmanan, and Atulya K. Nagar, Graph Access Structures With Optimal Pixel Expansion Three, Information and Computation, 230 (2013), 67-75.
  6. S. Arumugam, Mustapha Chellali, and Teresa W. Haynes, Equivalence Domination in Graphs, Quaestiones Mathematicae, 36 (2013), 331-340.
  7. S. Arumugam and M. Sundarakannan, Equivalence Dominating Sets in Graphs, Utilitas Mathematica, 91 (2013), 231-242.
  8. S. Arumugam, Karam ebadi and L. Sathikala, Twin Domination and Twin Irredundance in Digraphs, Applicable Analysis and Discrete Mathematics, 7 (2013), 275-284.
  9. S. Arumugam, R. Lakshmanan and Atulya K. Nagar, Visual cryptography scheme for graphs with vertex covering number two, Natl. Acad. Sci. Lett., 36(6) (2013), 575–579.
  10. S. Arumugam, Varughese Mathew and Jian Shen, On Fractional Metric Dimension of Graphs, Discrete Mathematics, Algorithms and Applications, 5 (4) (2013), 1350037 (8 pages)
  11. S. Arumugam, Bibin K. Jose, Csilla Bujtas and Zsolt Tuza, Equality of Domination and Transversal Numbers in Hypergraphs, Discrete Applied Mathematics, 161 (2013), 1859-1867.
  12. S. Arumugam, Martin Baca, Dalibor Froncek, Joe Ryan, Kiki A. Sugeng, Some open problems on graph labelings, AKCE Int. J. Graphs Comb., 10(2) (2013), 237-243.
  13. Neil Buckley, Atulya K. Nagar and S. Arumugam, Evolution of Visual Cryptography Basis Matrices with Binary Chromosomes, 2013 8th EUROSIM Congress on Modelling and Simulation (EUROSIM), IEEE Computer Society, (2013), 7-12.
  14. S. Arumugam, I. Sahul Hamid and V.M. Abraham, Decomposition of Graphs into Paths and Cycles, Journal of Discrete Mathematics, vol. 2013, Article ID 721051, 6 pages, 2013. doi:10.1155/2013/721051.
2014
  1. S. Arumugam, Mirka Miller, Oudone Phanalasy and Joe Ryan, Antimagic Labeling of Generalized Pyramid Graphs, Acta Mathematica Sinica, English Series, 30(2) (2014), 283-290.
  2. S. Arumugam, D. Haughton, B. Vasanthi, C. Zhang, Reciprocity in social networks - A case study in Tamil Nadu, India, CS-BIGS, 5(2) (2014), 126-131.
  3. S. Arumugam, N. Kamatchi and G.R. Vijayakumar, On the uniqueness of D-vertex magic constant, Discussiones Mathematicae Graph Theory, 34 (2014), 279-286.
  4. Neil Buckley, Atulya K. Nagar and S. Arumugam, Key-Based Steganographic Textual Secret Sharing for Confidential Messaging, In M. Pant et. Al (eds.) Proceedings of the Third Interantional Conference on Soft Computing for Problem Solving, Advances in Intelligent Systems and Computing, Springer 258 (2014), 25-34.
  5. Neil Buckley, Atulya K. Nagar and S. Arumugam, AnimVSS: Frame-Based Visual Secret Sharing, In M. Pant et. Al (eds.) Proceedings of the Third Interantional Conference on Soft Computing for Problem Solving, Advances in Intelligent Systems and Computing, Springer 258 (2014), 35-44.
  6. S. Arumugam, R. Lakshmanan and Atulya K. Nagar, On (k,n)*-Visual Cryptography Scheme, Des. Codes Cryptogr., 71 (1) (2014), 153-162.
  7. S. Arumugam, Karam Ebadi and Martin Manrique, Co-Secure and Secure Domination in Graphs, Util. Math., 94 (2014), 167-182.
  8. Neil Buckley, Atulya K. Nagar and S. Arumugam, Visual Secret Sharing between Remote Participants, International Journal of Computer Applications, 103(2) (2014), 8-17.
2015
  1. S. Arumugam, D. Haughtom, B. Vasanthi and C. Zhang, A comparative study of reciprocity in two rural social networks in Tamil Nadu, India. CS-BIGS, 6(1) (2015), 37-46.
  2. S. Arumugam and M. Sundarakannan, On Equality in an Upper Bound for the Equivalence domination Number, Quaestiones Mathematicae, 38(1) (2015), 63-71.
  3. Martin Manrique and S. Arumugam, Vertex and Edge Dimension of Hypergraphs, Graphs and Combinatorics, 31(2015), 183-200.
  4. S. Arumugam, Karam Ebadi and Martin Manrique, Co-Roman Domination in Graphs, Proceedings Mathematical Sciences, 125(1) (2015), 1-10.
  5. J. Bagga, L. Pauline Fotso, P. Biatch Max and S. Arumugam, New Classes of Graceful Unicyclic Graphs, Electronic Notes in Discrete Mathematics, 48 (2015), 27-32.
  6. M. Balakrishnan, G. Marimuthu and S. Arumugam, Vertex In-magic Arc Labelings of Digraphs, Electronic Notes in Discrete Mathematics, 48 (2015), 33-39.
  7. Jessica Pereira, T. Singh and S. Arumugam, On (k,d)-Skolem Graceful Graphs, Electronic Notes in Discrete Mathematics, 48 (2015), 81-88.
  8. S. Arumugam and M. Nalliah, Super (a,d)-Edge antimagic total labeling of Friendship and generalized Friendship Graphs, Electronic Notes in Discrete Mathematics, 48 (2015), 103-110.
  9. S. Arumugam, M. Balakrishnan and G. Marimuthu, E-Super vertex In-magic total labeling of Digraphs, Electronic Notes in Discrete Mathematics, 48 (2015), 111-118.
  10. N. Kamatchi, A. Ramalakshmi, S. Nilavarasi and S. Arumugam, A note on Distance Magic and Distance antimagic graphs, Electronic Notes in Discrete Mathematics, 48 (2015), 183-187.
  11. A. Godingo, T. Singh and S. Arumugam, On S-magic Graphs, Electronic Notes in Discrete Mathematics, 48 (2015), 267-273.
  12. Jessica Pereira, T. Singh and S. Arumugam, A new measure for gracefulness of graphs, Electronic Notes in Discrete Mathematics, 48 (2015), 275-280.
  13. B. Vasanthi, S. Arumugam, Atulya K. Nagar and Sovan Mitra, Applications of Signed Graphs to Portfolio Turnover Analysis, Proceedia-Social and Behavioral Sciences, 211(2015), 1203-1209.
  14. P. Jeya Bala Chitra and S. Arumugam, Resolving Sets without Isolated vertices, Procedia Computer Science 74 ( 2015 ), 38 – 42
  15. S. Arumugam, B. Jayaram and K. Thulasiraman, Independent Dominator Sequence Number of a Graph, Procedia Computer Science 74 ( 2015 ), 43 – 46
  16. S. Arumugam and J. Saral, Identification of Bottleneck Elements in Cellular Manufacturing Problem, Procedia Computer Science, 74 ( 2015 ), 181 – 185.
  17. S. Arumugam, S.T. Hedetniemi, S.M. Hedetniemi, L. Sathikala and S. Sudha, The Covering Chain of a Graph, Utilitas Math., 98 (2015), 183-196.
2016
  1. S. Arumugam, N. Kamatchi and P. Kovar, Distance Magic Graphs, Utilitas Math., 99 (2016), 131-142.
  2. S. Arumugam, Kiran Bhutani and L. Sathikala, On (r,s)-fuzzy Domination in Fuzzy Graphs, New Mathematics and Natural Computation, 12(1) (2016), 1-10.
  3. Neil Buckley, Atulya K Nagar and S. Arumugam, On Real-valued Visual Cryptographic Basis Matrices, Journal of Universal Computer Science, 21(12) (2015), 1536-1562.
  4. Jessica Pereira, T. Singh and S. Arumugam, m-Gracefulness of Graphs, Algorithms and Discrete Applied Mathematics, In CALDAM 2016, S. Govindarajan and A. Maheshwari (Eds.), Lecture Notes in Comput. Sci., 9602 (2016), 289-298.
Accepted Papers:
  1. R. Lakshmanan and S. Arumugam, Construction of a (k, n)-visual cryptography scheme, Des. Codes Cryptogr., DOI 10.1007/s10623-016-0181-z
  2. Neil Buckley, Atulya K. Nagar and S. Arumugam, On the use of secret sharing as a secure cipher, Special issue on Innovations in Systems and Software Engineering: A NASA Journal, DOI 10.1007/s11334-016-0273-y.
  3. S. Arumugam and R. Anantha Kumar, Distance Similar Sets in Graphs, Utilitas Math., (Accepted)
  4. S. Arumugam and M. Nalliah, Super (a, 3)-edge-antimagic total labeling for union of two stars, Utilitas Math., (Accepted)
  5. B. Vasanthi, S. Arumugam, and S.V. Nayana, Personal Sharing in Small Groups-A Case Study, Proceedia-Social and Behavioral Sciences (Accepted)
  6. Neil Buckley, Atulya K. Nagar and S. Arumugam, On Real-valued Visual Cryptographic Basis Matrices, Journal of Universal Computer Science (Accepted)
  7. SV. Divya Rashmi, A. Somasundram and S. Arumugam, Upper Secure Domination in Graphs, Electronic Notes in Discrete Mathematics (Accepted)
  8. S. Arumugam, Purnima Gupta and Rajesh Singh, Bounds on Graphoidal Length of a Graph, Electronic Notes in Discrete Mathematics (Accepted)
  9. S. Arumugam, J. Saral and A. Somasundaram, Minimizing the Number of Exceptional Edges in Cellular Manufacturing Problem, Electronic Notes in Discrete Mathematics (Accepted)
  10. M. Indumathy, S. Arumugam, Veeky Baths and T. Singh, Graph Theoretic Concepts in the Study of Biological Networks, Applied Analysis with Applications in Biological and Physical Sciences, Springer (Accepted)
  11. S. Arumugam, J. Saral and Ashwin Ganesan, Decomposition of Bipartite Graphs Arising in Cellular Manufacturing Systems, Int. J. Advance. Soft Comput. Appl., (Accepted)
  12. R. Kanniga Devi, K. Vimala Devi, and S. Arumugam, Dynamic Batch Mode Cost-efficient Independent Task Scheduling Scheme in Cloud Computing, Int. J. Advance. Soft Comput. Appl., (Accepted)
  13. S. Arumugam, S. Sriram, D. Ranganayakulu, Ibrahim Venkat and K.G. Subramanian, Eccentric Digraphs of Tournaments, Int. J. Advance. Soft Comput. Appl., (Accepted)
  14. S.V. Divya Rashmi, S. Arumugam, and Ibrahim Venkat, Secure Domination and Secure Irredundance in Graphs, Int. J. Advance. Soft Comput. Appl., (Accepted)