n-CARDMATH Publications

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.

17.  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.

18.  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.

19.  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.

20.  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.

21.  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.

22.  S. Arumugam and I. Sahul Hamid, Simple Graphoidal Covers in a Graph,          J. Combin. Math. Combin. Comput., 64(2008), 79-95.

23.  S. Arumugam and Sithara Jerry, A note on independent domination in graphs, Bulletin of the Allahabad Mathematical Society, 23(1) (2008), 57-64.

24.  S. Arumugam, I. Sahul Hamid, Simple path covers in Graphs, International J. Math. Combin., 3(2008), 94-104.

25.  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.

26.  S. Arumugam and K. Reji Kumar, Basic Minimal Dominating Functions, Utilitas Math., 77 (2008), 235-247.

27.  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

28.  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.

29.  K. Reji Kumar, S. Arumugam and Gary MacGillivray, On Maximal Fractional Independent Sets In Graphs, Ars Combinatoria, 87(2008), 205-212.

30.  S. Arumugam, K.A. Germina and  V. Ajitha, On (k,d) multiplicative indexable graphs, J. Combin.Math. Combin. Comput., 69(2009), 15-21.

31.   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.

32.  S. Arumugam and Hebzibai Jeyakumar, Asteroidal Chromatic Number of a Graph, J. Combin.Math. Combin. Comput.,  69(2009), 39-44.

33.  S. Arumugam and I. Sahul Hamid, Graphs with unique minimum simple acyclic graphoidal cover, J. Combin.Math. Combin. Comput.,  69(2009), 45-52.

34.   V. Ajitha, S. Arumugam and K.A. Germina, On square sum graphs, AKCE. J. Graphs. Combin., 6(1) (2009), 1-10.

35.  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.

36.  S. Arumugam, S. Velammal, Connected Edge domination in graphs, Bulletin of Allahabad mathematical Society, 24(1) (2009), 43-49.

37.  S. Arumugam and Sithara Jerry, Fractional Edge Domination in Graphs, Appl. Anal. Discrete Math.3(2009),  359-370.

38.  S. Arumugam and R. Kala, A Note on Global Domination in Graphs, Ars Combinatoria, 93(2009), 175-180

39.  A. Anitha, S. Arumugam and E. Sampathkumar, Degree Equitable Sets in a Graph, International J.Math. Combin., 3(2009), 32-47.

40.  S. Arumugam, Coloring and Domination in Graphs, The Mathematics Student, 77(1-4)(2008), 119-129.

41.  S. Arumugam, O. Favaron and S. Sudha, Irredundance Saturation Number of a Graph, Australasian Journal of Combinatorics, 46(2010), 37-49.

42.  S. Arumugam, K. Karuppasamy and I. Sahul Hamid, Fractional Global Domination in Graphs, Discussiones Mathematicae Graph Theory, 30(2010), 33-44.

43.  S. Arumugam and S. Sudha, Min-Max Dom-Saturation Number of a Tree, International J.Math. Combin., 2(2010), 45-52.

44.  A. P. Santhakumaran, S. Arumugam, Radius and Diameter with Respect to Cliques in Graphs, J. Combin. Matha.Combin.Comput., 72(2010), 231-241.

45.  S. Arumugam and C. Sivagnanam, Neighborhood Connected Domination in Graphs, J. Combin.Math. Combin. Comput.,  73(2010), 55-64.

46.  S. Arumugam and Sithara Jerry, The convexity graph of minimal dominating functions of a graph, Proc. Jangjeon Math. Soc., 13 (2)(2010), 219-230.

47.  S. Arumugam and M. Sundarakannan, On k-Equivalence Dominating Sets in Graphs, International J.Math. Combin., 4 (2010), 86-93.

48.  L. Benedict Michaelraj, S.K. Ayyaswamy and S. Arumugam, Chromatic Transversal Domination in Graphs, J. Combin. Math. Combin. Comput., 75(2010), 33-40.

49.  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.

50.  S. Arumugam and C. Sivagnanam, Neighborhood Connected Domatic Number of a Graph, J. Combin. Math. Combin. Comput., 75(2010), 239-249.

51.  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.

52.  S. Arumugam, Teresa W. Haynes, Michael A. Henning and Yared Nigussie, Maximal Independent Sets in Minimum Colorings, Discrete Math., 311(2011), 1158-1163.

53.  S. Arumugam, Domination in Graphs, Graph Theory Research Directions, Eds. Pratima Panigrahi and S.B. Rao, Narosa Publishing House, (2011),35-47.

54.  S. Arumugam, K.A. Germina and  T.M. K. Anandavally, On Additively Geometric Graphs, J. Combin. Math. Combin.Comput., (To appear)

55.  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 Enginerring (ISME 2006), during March 10-12, 2006 (To appear)

56.  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. (To appear)

57.  K.G Srinivasagan, L. Ganesan and S. Arumugam, HMM based Tamil Handwritten Character Recognition,  4th FAE International Symposium 2006, Europeen University of Legke, Turkey. (To appear)

58.  S. Arumugam and M. Sundarakannan, Equivalence Dominating Sets in Graphs, Utilitas Mathematica, (To appear)

59.  S. Arumugam and C. Sivagnanam, Neighborhood Total Domination in Graphs, Opuscula Mathematica, (To appear).

60.  S. Arumugam and M. Sundarakannan, The equivalence chain of a graph, J. Combin. Math. Combin. Comput., (To appear)

61.  S. Arumugam and Varughese Mathew, The Fractional Metric Dimension of  Graphs, Discrete Math., (To appear)

62.  A. Anitha, S. Arumugam and Mustapha Chellali, Equitable Domination in Graphs, Discrete Mathematics, Algorithms and Applications, (To appear)

63.  S. Arumugam and Latha Martin, Degrees and Degree Sequence of k-edge d-critical graphs, Journal of Discrete Mathematical Sciences & Cryptography, (To appear).

64.  S. Arumugam, Dalibor Froncek and N. Kamatchi, Distance Magic Graphs – A Survey The Journal of Indonesian Mathematical Society, (To appear)

65.  S. Arumugam, K. Raja Chandraseka, Neeldhara Misra, Geevarghese Philip and Saket Saurabh, Algorithmic Aspects of Dominator Colorings in Graphs, Springer-Verlag Lecture Notes in Computer Science, (To appear).