• n-CARDMATH

    n-CARDMATH Subprojects Publications



    1. P. Mahadevan and C. Thangaraj, Solid Waste Management Planning for Greater Madurai Region, Proc. International Congress of Environmental Research (ICER-07), Bhopal, (2007), 28-30.
    2. S. Anand, P. Sivakumar "Optimization of simulation based sequential circuit test automation", National conference on resent trends in VLSI Design 2007 (NATCORN'07), Organized by Noorul Islam College of Engineering.
    3. A.P.Santhakumaran and P.Titus, The Vertex Detour Number of a Graph, AKCE International Journal of Graphs and Combinatorics, 4(1) (2007), 99-112.
    4. A.P. Santhakumaran, Periphery with respect to Cliques in Graphs, Journal of Discrete Mathematical Sciences & Cryptography, 10(2)(2007), 245-254.
    5. A.P. Santhakumaran and J. John, Edge Geodetic Number of a Graph, Journal of Discrete Mathematical Sciences & Cryptography, 10(3)(2007), 415-432.
    6. A.P. Santhakumaran and J. John, The Edge Steiner Number of a Graph, Journal of Discrete Mathematical Sciences & Cryptography, 10 (5)(2007), 677-696.
    7. T. Tamizh Chelvam and I. Rani, Dominating sets in Cayley Graphs on Zn, Tamkang Journal of Mathematics, 38 (2007) 341-345.
    8. A.P. Santhakumaran and P. Titus, The upper and forcing vertex detour number of a graph, International Journal of Mathematical Combinatorics, 2 (2008), 109-120.
    9. A.P. Santhakumaran and S.V. Ullas Chandran, On the edge geodetic number and k-edge geodetic number of a graph, International Journal of Mathematical Combinatorics, 3 (2008), 85-93.
    10. P. Subbaraj, S. Saravanasankar and S. Anand, "A new hybrid genetic algorithm for VLSI circuit partitioning", International conference on Intelligent Systems and Control 2009 (ISCO 2009), Karpagam University, 2009.
    11. S. Anand and A. Aravindhan, "Multi-Warned Hybrid Genetic Algorithm for VLSI Physical Design Specific to Placement Problem", National Conference on Microelectronics and Communication 2009 (NCMEC 2009)
    12. S. Ramesh, S. Kannan and S. Baskar, Application of a Fast and Elitist Multi-Objective Genetic Algorithm to Reactive Power Dispatch, Serbian Journal of Electrical Engineering, 6(1) (2009), 119-133.
    13. S. Ramesh, S. Kannan and S. Baskar, Implementation of MOPSO Algorithm to Optimal Reactive Power Dispatch, Proceedings of the International Conference on Electrical Energy Systems and Power Electronics in Emerging Economics, (2009), 778-784.
    14. T. Tamizh Chelvam and I. Rani, Independent Domination number of Cayley Graphs on Zn, The Journal of Combinatorial Mathematics and Combinatorial Computing, 69 (2009) 251-255.
    15. T. Tamizh Chelvam and M.S. Mutharasu, Efficient Domination in Bi-Cayley Graphs, International Journal of Mathematical Combinatorics, 4 (2009) 56-62.
    16. T. Tamizh Chelvam, L. Barani Kumar and M.S. Mutharasu, Distance g-domination in Circulant graphs, International Journal of Applied Mathematics, 1 (2009), 79-86.
    17. A.P. Santhakumaran, P. Titus and J. John, The Upper Connected Geodetic Number and Forcing Connected Geodetic Number of a Graph, Discrete Applied Mathematics, 157 (2009), 1571-1580.
    18. A.P. Santhakumaran and S. Athisayanathan, Edge detour graphs with edge detour number 2, International Journal of Mathematical Combinatorics, 1 (2009), 77-89.
    19. A.P. Santhakumaran and J. John, Connected Edge Geodetic Number of a Graph, SCIENTIA Series A: Mathematical Sciences, 17 (2009), 67-82.
    20. A.P. Santhakumaran and S. Athisayanathan, Edge Detour Graphs, J. Combin. Math. Combin.Comput., 69 (2009), 191-204.
    21. A.P. Santhakumaran and S. Athisayanathan, Connected Detour Number of a Graph, J. Combin. Math. Combin.Comput., 69 (2009), 205-218.
    22. A.P. Santhakumaran, P. Titus and J. John, On the Connected Geodetic Number of a Graph, J. Combin. Math. Combin.Comput., 69(2009), 219-229.
    23. A.P. Santhakumaran and P. Titus, The Edge Fixed Geodomination Number of a Graph, An. St. Univ. Ovidius Constanta, 17 (1) (2009), 187-200.
    24. A.P. Santhakumaran and J. John, The upper edge geodetic number and the forcing edge geodetic number of a Graph, Opuscula Mathematica, 29 (4) (2009), 427-441.
    25. A.P. Santhakumaran and P. Titus, The Connected Vertex Geodomination number of a Graph, The Journal of Prime Research in Mathematics, 5 (2009), 101-114.
    26. A.P. Santhakumaran and S. Athisayanathan, On the connected detour number of a graph, Journal of prime research in Mathematics, 5 (2009), 149-170.
    27. S. Dhanalakshmi, S. Kannan, K. Mahadevan and S. Baskar, Multi-Objective Dispatch Problem using NSGA-II, Proceeding of the International Conference on Recent Advancements in Electrical Sciences (ICRAES-10), (2010 ) , 314-321.
    28. P. Subbaraj, S. Saravanasankar and S. Anand, "Comparison of implicit data parallel and sequential genetic algorithms for VLSI standard cell placement", International conference on advances in industrial engineering applications (ICAIEA-2010), DoIE, Anna University, Gundy, Chennai on Jan 2010.
    29. T. Tamizh Chelvam and I. Rani, Total and Connected Domination numbers for Cayley Graphs on Zn, Advanced Studies in Contemporary Mathematics, 20(1) (2010) 57-61.
    30. T. Tamizh Chelvam, M.S.Mutharasu and I. Rani, Domination in Generalized Circulant Graphs, Indian Journal of Mathematics, 52, No.3 (2010), 531-541
    31. A.P. Santhakumaran and S.V. Ullas Chandran, The Edge Geodetic Number and Cartesian Product of Graph, Discussiones Mathematicae Graph Theory, 30(1) (2010), 55-73.
    32. A.P. Santhakumaran and S. Athisayanathan, On Edge detour Graphs, Discussiones Mathematicae Graph Theory, 30(1) (2010),155-174.
    33. A.P. Santhakumaran and S. Athisayanathan, The Forcing weak Edge detour Number of a Graph, International Journal of Mathematical Combinatorics, 2 (2010), 22-29.
    34. A.P. Santhakumaran and S. Arumugam, Radius and Diameter with respect to Cliques in Graphs, J. Combin. Math. Combin.Comput., 72(2010),231-241.
    35. A. P. Santhakumaran, Center of a graph with respect to edges, SCIENTIA, Series A: Mathematical Sciences, 19 (2010), 13-23.
    36. A. P. Santhakumaran and Kumari Latha, On the open geodetic number of a graph, SCIENTA Series A: Mathematical Sciences, 19 (2010), 131-142.
    37. A.P. Santhakumaran and S.V. Ullas Chandran, The geodetic number of strong product graphs, Discussiones Mathematicae Graph Theory, 30 (2010), 687-700.
    38. A.P. Santhakumaran and P. Titus, The Connected Vertex Detour Number of a Graph, Acta Univ. Sapientiae, Mathematica, 2(2010), 146-159.
    39. A.P. Santhakumaran and S. Athisayanathan, Forcing Edge detour no. of edge detour Graphs, Journal of prime research in Mathematics, 6(2010), 13-21.
    40. R. Sundareswaran and V. Swaminathan, Domination Integrity of graphs, Proceedings of International conference on Mathematical and Experimental Physics, Narosa Publishing House, (2010), 46-57.
    41. R. Sundareswaran and V. Swaminathan, Domination Integrity of Middle graphs, Proceedings of National conference on Algebra, Graph Theory and their applications, (2010), 88- 92.
    42. S. Dhanalakshmi, S. Kannan, K. Mahadevan and S. Baskar, Application of Modified NSGA-II Algorithm to Combined Economic and Emission Dispatch, International Journal of Electric Power and Energy Systems , 33(4) (2011), 992-1002.
    43. S. Dhanalakshmi, S. Kannan and K. Mahadevan, Market Models for Deregulated Environment-A Review, IEEE International Conference on Emerging Trends in Electrical and Computer Technology (ICETECT 2011), (2011), 82-87.
    44. M. Prakash, S. Dhanalakshmi and S. Kannan, Consumer Payment Minimization in Deregulated Market, Proceedings of the National Conference on Electrical Systems and Renewable Energy (NESR 2011), (2011), 12-16.
    45. S. Dhanalakshmi, S. Kannan, S. Baskar and K. Mahadevan, Intelligent Genetic Algorithm for Generation Scheduling under deregulated environment, SEMCCO 2011, Part I, LNCS 7076 (2011), 282-289.
    46. S. Ramesh, S. Kannan and S. Baskar, Application of an Improved Generalized Differential Evolution Algorithm to Multi-objective Optimization Problems, SEMCCO 2011, Part I, LNCS 7076 (2011), 77-84.
    47. S. Ramesh, S. Kannan and S. Baskar, Application of Modified NSGA-II Algorithm to Reactive Power Optimization, D. Nagamalai, E. Renault, M. Dhanushkodi (Eds.): CCSEIT 2011, Springer Verlag, CCIS 204 (2011), 344-354.
    48. A. Aravindhan, S. Anand, P.S. Godwin Anand, "An analogous computation on hybrid genetic algorithm for VLSI physical design specific to placement problem" International Journal of computer applications, 2 (1), (2011), 30-35.
    49. P. Subbaraj, S. Saravanasankar and S. Anand, "Combinatorial Optimization in VLSI Hypergraph Partitioning using Taguchi Methods", International Journal of Mathematical Combinotrics, 3 (2011), 69-84.
    50. P. Subbaraj, S. Saravanasankar and S. Anand, "Multi-Objective Optimization in VLSI Floorplanning", In proc. of International Conference on Logic, Information, Control and Computation 2011, Ed. P. Balasubramanian, Springer Verlag, CCIS 140 (2011), 65-72.
    51. T. Tamizh Chelvam and M.S. Mutharasu, Total domination in Circulant graphs, Int. J. Open Problems Compt. Math., 4 (2) (2011), 168-174.
    52. T. Tamizh Chelvam and M.S. Mutharasu, Efficient domination in Cartesian product of cycles, Journal of Advanced Research in Pure Mathematics, 3(3) (2011), 42-49.
    53. A.P. Santhakumaran and J.John, The forcing Steiner number of a graph, Discussiones Mathematicae Graph Theory, 31(2011), 171-181.
    54. A.P.Santhakumaran and S. V. Ullas Chandran, The hull number of strong product graphs, Discussiones Mathematicae Graph Theory, 31(3) (2011) , 493-507.
    55. A. P. Santhakumaran, T. Jebaraj and S. V. Ullas Chandran, The linear geodetic number of a graph, Discrete Mathematics, Algorithms and Applications, 3 (3) (2011), 357-368.
    56. A.P. Santhakumaran and J. John, On the forcing geodetic and forcing Steiner numbers of a graph, Discussiones Mathematicae Graph Theory, 31(4) (2011), 611-624
    57. A.P. Santhakumaran and P. Titus, The connected forcing connected vertex detour number of a graph, Discussiones Mathematicae Graph Theory, 31 (2011 ) 461-473.
    58. R. Sundareswaran and V. Swaminathan, Equi-toughness partitions of graphs, J. Combin. Math. Combin. Comput., 79 (2011), 197-210.
    59. K. Karthikeyan, S. Kannan, S. Baskar, and C. Thangaraj, Application of Restart Covariance Matrix Adaptation Evolution Strategy (RCMA-ES) to Generation Expansion Planning Problem, ICTACT Journal on Soft Computing, 3 (1) (2012), 401-407
    60. S. Ramesh, S. Kannan and S. Baskar, Application of modified NSGA-II algorithm to multi-objective reactive power planning, Applied Soft Computing, 12 (2012), 741-753.
    61. S. Saravanan, S. Kannan and C. Thangaraj, India's Electricity Demand Forecast Using Regression Analysis and Artificial Neural Networks Based on Principal Components, ICTACT Journal on Soft Computing, 2(4) (2012), 365-370.
    62. T. Tamizh Chelvam and Sivagnanam Mutharasu,: Efficient open domination in Cayley graphs, Applied Mathematics Letters, 25(10) (2012), 1560-1564.
    63. T. Tamizh Chelvam and G. Kalaimurugan, Signed star domination number of Cayley graphs, Discrete Mathematics, Algorithms and Applications, 04, 1250017 (2012) [10 pages].
    64. T. Tamizh Chelvam and G. Kalaimurugan, Domination in Cayley graph on Dihedral groups, Open Journal of Discrete Mathematics, 2 (2012), 5-10.
    65. A. P. Santhakumaran and S. V. Ullas Chandran The 2-edge geodetic number and graph operations, Arabian Journal of Mathematics 1 (2012), 241-249.
    66. A. P. Santhakumaran, T. Jebaraj and S. V. Ullas Chandran, The linear edge geodetic graphs, Journal of Applied Mathematics & Informatics, 30 (5-6) (2012), 871 - 882
    67. A. P. Santhakumaran and S. V. Ullas Chandran, The detour hull number of a graph, Algebra and Discrete Mathematics, 14(2) (2012), 307-322.
    68. S. Anand, S. Saravanasankar and P. Subbaraj, An Multi-Objective Optimization tool for VLSI Non-Slicing Floorplanning, International Journal of Circuit Theory and Applications, 41(9) (2013), 904-923.
    69. K. Karthikeyan, S. Kannan, S. Baskar, and C. Thangaraj, Application of Self-adaptive Differential Evolution Algorithm to Generation Expansion Planning Problem, J. Electrical Systems, 9(2) (2013), 203-211.
    70. K. Karthikeyan, S. Kannan, S. Baskar, and C. Thangaraj, Application of Opposition-based Differential Evolution Algorithm to Generation Expansion Planning Problem, J Electr Eng Technol , 8 (4) (2013), 686-693.
    71. S. Dhanalakshmi, S. Baskar, S. Kannan and K. Mahadevan, Generation Scheduling problem by Intelligent Genetic Algorithm, Computers and Electrical Engineering, 39(2013), 79-88.
    72. S. Saravanan, R. Nithya, S. Kannan and C. Thangaraj, Modeling and Prediction of India's Electricity Demand Using Fuzzy Logic, IEEE International Conference on Circuit, Power and Computing Technologies, (2014), 93-96.
    73. S. Saravanan, S. Amosedinakaran, S. Kannan and C. Thangaraj, Forecasting of India's Electricity Consumption Using Differential Evolution algorithm, International Conference on Innovations in Information Embedded and Communication Systems-2014, 310-314.
    74. S.Saravanan, S.Amosedinakaran, S.Kannan and C. Thangaraj, India's Electricity Demand Estimation Using Genetic Algorithm, 2014 IEEE International Conference on Circuit, Power and Computing Technologies [ICCPCT], 97-101.
    75. S. Ramesh, S. Kannan and S. Baskar, Multi-objective Evolutionary Algorithm based Reactive Power Dispatch with Thyristor Controlled Series Compensator, Proceedings of the IEEE conference on Power India, DOI:10.1109/ PEDES.2010.5712423
    76. S. Anand, S. Saravanasankar and P. Subbaraj, "Customized Simulated Annealing Based Decision Algorithms for Combinatorial Optimization in VLSI Floor planning Problem", Computational Optimization and Applications, Springer publishers, 2011. DOI 10.1007/s10589-011-9442-y.
    77. P. Subbaraj, S. Saravanasankar, and S. Anand, "Parallel Genetic Algorithm for VLSI Standard Cell Placement", In Proceedings of the 2009 International Conference on Advances in Computing, Control, and Telecommunication Technologies (ACT '09), IEEE Computer Society, Washington, DC, USA, PP.80-84, 2009. DOI=10.1109/ACT.2009.30 http://dx.doi.org/10.1109/ACT.2009.30
    78. A. P. Santhakumaran and S. V. Ullas Chandran, Monophonic number of Cartesian product graphs, Indiana University Mathematics Journal, (To appear).
    79. A.P. Santhakumaran and J. John, The upper connected edge geodetic number of a graph, FILOMAT, (To appear).
    80. A.P. Santhakumaran and S. Athisayanathan, The forcing edge-to- vertex detour number of a graph, International Journal of Combinatorial Graph Theory and Applications, (To appear).
    81. A.P.Santhakumaran and S.Athisayanathan, Weak Edge Detour Number of a Graph, ARS Combinatoria, (To appear).
    82. A.P. Santhakumaran and P. Titus, On the Vertex Geodomination Number of a Graph, ARS Combinatoria, (To appear).
    83. A.P. Santhakumaran and P. Titus, Geodesic Graphs, ARS Combinatoria, (To appear).
    84. A.P. Santhakumaran and P. Titus, The Geo-number of a Graph, ARS Combinatoria, (To appear).
    85. A.P. Santhakumaran and S.V. Ullas Chandran, The k- Edge Geodetic Number of a graph, Utilitas Mathematica, (To appear).