Skip to main content
SpringerLink
Log in

Folding Automaton for Paths and Cycles

  • Conference paper
  • First Online:
Proceedings of the 2nd International Conference on Data Engineering and Communication Technology

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 828))

  • 1084 Accesses

Abstract

In this paper, folding automata for paths and cycles are obtained. For given paths (Pn) and cycles (Cn), automata are studied and folding concepts are applied to paths and cycles and also obtained folding automata. Also obtained the result that for Pn, n is odd and n > 2 the vertex folding is possible (vertex symmetry is available), and if n is even, the edge folding is possible since there is an availability of edge symmetry. And for cycle Cn, edge folding is possible only for even number of vertices.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Hodgson BR (1983) Théories décidables par automate fini. Annales de Sciences Mathématiques 7(39–57):14

    Google Scholar 

  2. Harary F (1972) Graph theory, Third Printing. Addison Wesley Publishing Company, Boston

    Google Scholar 

  3. Bondy JA, Murthy USR (2015) Graph theory with applications

    Google Scholar 

  4. Deo N (1995) Graph theory with applications to engineering and computer science. PHI Publications, New Delhi

    Google Scholar 

  5. Hopcroft JE, Motwani R, Ullman JD Introduction to automata theory, languages, and computation, 3rd edn. Pearson Publication, London

    Google Scholar 

  6. Gallian JA (2010) A dynamic survey of graph labelling. Electronic Journal of combinatorics

    Google Scholar 

Download references

Acknowledgements

The authors would like to thank Dr. Ponnammal Natarajan, Former Director—Research and Development, Anna University Chennai, India, for her initiative ideas and fruitful discussions with respect to the paper’s contribution.

Author information

Authors and Affiliations

  1. Mother Teresa Women’s University, Kodaikanal, Tamil Nadu, India

    N. Subashini

  2. Pacheri Sri Nallathangal Amman College of Engineering and Technology, Dindigul, Tamil Nadu, India

    K. Thiagarajan

  3. Bharathiar University, Coimbatore, Tamil Nadu, India

    J. Padmashree

Authors
  1. N. Subashini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Thiagarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Padmashree
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to K. Thiagarajan or J. Padmashree .

Editor information

Editors and Affiliations

  1. Symbiosis Institute of Technology, Symbiosis International University, Pune, Maharashtra, India

    Anand J. Kulkarni

  2. Department of CSE, PVP Siddhartha Institute of Technology, Vijayawada, Andhra Pradesh, India

    Suresh Chandra Satapathy

  3. School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore, Singapore

    Tai Kang

  4. Faculty of Industrial and Systems Engineering, Tarbiat Modares University, Tehran, Iran

    Ali Husseinzadeh Kashan

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Subashini, N., Thiagarajan, K., Padmashree, J. (2019). Folding Automaton for Paths and Cycles. In: Kulkarni, A., Satapathy, S., Kang, T., Kashan, A. (eds) Proceedings of the 2nd International Conference on Data Engineering and Communication Technology. Advances in Intelligent Systems and Computing, vol 828. Springer, Singapore. https://doi.org/10.1007/978-981-13-1610-4_67

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-1610-4_67

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-1609-8

  • Online ISBN: 978-981-13-1610-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation