Skip to main content
SpringerLink
Log in

Theoretical Computer Science and Discrete Mathematics

First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. S. Arumugam

    1. Kalasalingam University, Krishnankoil, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jay Bagga

    1. Ball State University, Muncie, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Lowell W. Beineke

    1. Indiana University – Purdue University, Fort Wayne, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. B.S. Panda

    1. Indian Institute of Technology, New Delhi, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10398)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: ICTCSDM 2016.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (58 papers)

  1. Front Matter

    Pages I-XIII
    Download chapter 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
Back to top

Other volumes

  1. Theoretical Computer Science and Discrete Mathematics

Keywords

About this book

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. 

Editors and Affiliations

  • 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

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation