Theoretical Computer Science and Discrete Mathematics

1. Super Edge-Antimagic Gracefulness of Disconnected Graphs

   • G. Marimuthu, P. Krishnaveni

   Pages 152-155

2. Mixed Noise Elimination and Data Hiding for Secure Data Transmission

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

   Pages 156-164

3. Analysis of Particle Swarm Optimization Based 2D FIR Filter for Reduction of Additive and Multiplicative Noise in Images

   • V. Muneeswaran, M. Pallikonda Rajasekaran

   Pages 165-174

4. Irregularity Strength of Corona of Two Graphs

   • K. Muthu Guru Packiam, T. Manimaran, A. Thuraiswamy

   Pages 175-181

5. 1-Distant Irregularity Strength of Graphs

   • K. Muthu Guru Packiam, T. Manimaran, A. Thuraiswamy

   Pages 182-190

6. Cloud Data Security Based on Data Partitions and Multiple Encryptions

   • B. Muthulakshmi, M. Venkatesulu

   Pages 191-196

7. Upper Majority Domination Number of a Graph

   • A. Muthuselvi, S. Arumugam

   Pages 197-202

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

   • M. Nalliah, S. Arumugam

   Pages 203-211

9. On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph

   • Olayiwola Babarinsa, Hailiza Kamarulhaili

   Pages 212-217

10. On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs

    • B. S. Panda, Arti Pandey

    Pages 218-227

11. Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs

    • B. S. Panda, Shaily Verma

    Pages 228-237

12. On Prime Distance Labeling of Graphs

    • A. Parthiban, N. Gnanamalar David

    Pages 238-241

13. Dominator Colorings of Products of Graphs

    • P. Paulraja, K. Raja Chandrasekar

    Pages 242-250

14. Efficient Hybrid Approach for Compression of Multi Modal Medical Images

    • B. Perumal, M. Pallikonda Rajasekaran, T. Arun Prasath

    Pages 251-261

15. The Median Problem on Symmetric Bipartite Graphs

    • K. Pravas, A. Vijayakumar

    Pages 262-270

16. Intuitionistic Fuzzy Automaton with Unique Membership and Unique Nonmembership Transitions

    • K. Jency Priya, T. Rajaretnam

    Pages 271-280

17. Independent 2-Point Set Domination in Graphs

    • Purnima Gupta, Deepti Jain

    Pages 281-288

18. On Graphs Whose Graphoidal Length Is Half of Its Size

    • Purnima Gupta, Rajesh Singh

    Pages 289-299

19. Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets

    • Purnima Gupta, Alka, Rajesh Singh

    Pages 300-304

20. Graphoidal Length and Graphoidal Covering Number of a Graph

    • Purnima Gupta, Rajesh Singh, S. Arumugam

    Pages 305-311

This volume constitutes the refereed post-conference proceedings of the International Conference on Theoretical Computer Science and Discrete Mathematics, held in Krishnankoil, India, in December 2016.

The 57 revised full papers were carefully reviewed and selected from 210 submissions. The papers cover a broad range of topics such as line graphs and its generalizations, large graphs of given degree and diameter, graphoidal covers, adjacency spectrum, distance spectrum, b-coloring, separation dimension of graphs and hypergraphs, domination in graphs, graph labeling problems, subsequences of words and Parike matrices, lambda-design conjecture, graph algorithms and interference model for wireless sensor networks. 

• artificial intelligence
• bipartite graphs
• cloud computing
• coloring
• computer systems
• cryptography
• data security
• databases
• formal languages
• genetic algorithms
• graph theory
• graphic methods
• image compression
• image processing
• image reconstruction
• reversible data hiding
• semantics
• signal processing
• steganography
• wireless telecommunication systems
• algorithm analysis and problem complexity

• Kalasalingam University, Krishnankoil, India

  S. Arumugam

• Ball State University, Muncie, USA

  Jay Bagga

• Indiana University – Purdue University, Fort Wayne, USA

  Lowell W. Beineke

• Indian Institute of Technology, New Delhi, India

  B.S. Panda

Policies and ethics