Theoretical Computer Science and Discrete Mathematics

1. Front Matter

   Pages I-XIII

   PDF

2. Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two

   • A. Anu, S. Monikandan

   Pages 1-9

3. 1-Normal DRA for Insertion Languages

   • Abhisek Midya, Lakshmanan Kuppusamy, V. S. Sumitha, Alok Kumar Pani

   Pages 10-19

4. Formal Language Representation and Modelling Structures Underlying RNA Folding Process

   • Anand Mahendran, Lakshmanan Kuppusamy

   Pages 20-29

5. Homometric Number of a Graph and Some Related Concepts

   • Anu V., Aparna Lakshmanan S.

   Pages 30-37

6. Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2

   • Ashok Kumar Das, Ritapa Chakraborty

   Pages 38-49

7. Global Secure Domination in Graphs

   • S. V. Divya Rashmi, S. Arumugam, A. Somasundaram

   Pages 50-54

8. A Novel Reversible Data Hiding Method in Teleradiology to Maximize Data Capacity in Medical Images

   • S. Fepslin Athish Mon, K. Suthendran, K. Arjun, S. Arumugam

   Pages 55-62

9. Indicated Coloring of Cartesian Product of Graphs

   • P. Francis, S. Francis Raj

   Pages 63-68

10. A Bi-level Security Mechanism for Efficient Protection on Graphs in Online Social Network

    • D. Franklin Vinod, V. Vasudevan

    Pages 69-75

11. On Nearly Distance Magic Graphs

    • Aloysius Godinho, T. Singh, S. Arumugam

    Pages 76-82

12. Evenly Partite Directed Bigraph Factorization of Wreath Product of Graphs

    • P. Hemalatha

    Pages 83-89

13. Minimum Layout of Circulant Graphs into Certain Height Balanced Trees

    • Jessie Abraham, Micheal Arockiaraj

    Pages 90-97

14. Dissecting Power of Certain Matrix Languages

    • J. Julie, J. Baskar Babujee, V. Masilamani

    Pages 98-105

15. Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set

    • N. Kalai Mathi, S. Monikandan

    Pages 106-112

16. Distance Antimagic Labelings of Graphs

    • N. Kamatchi, G. R. Vijayakumar, A. Ramalakshmi, S. Nilavarasi, S. Arumugam

    Pages 113-118

17. Probabilistic Conjunctive Grammar

    • K. Kanchan Devi, S. Arumugam

    Pages 119-127

18. (1, 2)-Domination in Graphs

    • K. Kayathri, S. Vallirani

    Pages 128-133

19. New Construction on SD-Prime Cordial Labeling

    • A. Lourdusamy, F. Patrick

    Pages 134-143

20. Dominator Coloring of Generalized Petersen Graphs

    • J. Maria Jeyaseeli, Nazanin Movarraei, S. Arumugam

    Pages 144-151

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