Skip to main content
SpringerLink
Log in

Parikh Word Representable Graphs and Morphisms

  • Conference paper
  • First Online:
Book cover Developments in Language Theory (DLT 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12811))

Included in the following conference series:

  • 382 Accesses

Abstract

Study on numerical properties of words based on scattered subwords of words was initiated around the year 2000, introducing certain upper triangular matrices, called Parikh matrices. On the other hand, linking the areas of combinatorics on words and graph theory, a class of graphs, called Parikh word representable graphs (PWRG) of words, was introduced based on certain scattered subwords of words. Several properties of PWRG have been investigated, especially corresponding to binary words. Here, we derive several structural properties of PWRG of images of ternary words under certain morphisms.

N. Thomas—Research Scholar, K. G. Subramanian—Honorary Visiting Professor.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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

References

  1. Atanasiu, A.: Parikh matrices, amiability and Istrail morphism. Int. J. Found. Comput. Sci. 21(6), 1021–1033 (2010)

    Article  MathSciNet  Google Scholar 

  2. Atanasiu, A.: Binary amiable words. Int. J. Found. Comput. Sci. 18(02), 387–400 (2007)

    Article  MathSciNet  Google Scholar 

  3. Atanasiu, A., Atanasiu, R., Petre, I.: Parikh matrices and amiable words. Theor. Comput. Sci. 390(1), 102–109 (2008)

    Article  MathSciNet  Google Scholar 

  4. Bera, S., Mahalingam, K.: Structural properties of word representable graphs. Math. Comput. Sci. 10(2), 209–222 (2016)

    Article  MathSciNet  Google Scholar 

  5. Bondy, G.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam (1982)

    MATH  Google Scholar 

  6. Istrail, S.: On irreducible languages and nonrational numbers. Bulletin mathématique de la Société des sciences mathématiques de Roumanie 21, 301–308 (1977)

    MathSciNet  MATH  Google Scholar 

  7. Kitaev, S., Lozin, V.: Words and Graphs, vol. 17. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25859-1

  8. Kitaev, S., Salimov, P., Severs, C., Ulfarsson, H.: Word-representability of line graphs. Open J. Discrete Math. 1(2), 96–101 (2011)

    Article  MathSciNet  Google Scholar 

  9. Mateescu, A., Salomaa, A.: Matrix indicators for subword occurrences and ambiguity. Int. J. Found. Comput. Sci. 15(02), 277–292 (2004)

    Article  MathSciNet  Google Scholar 

  10. Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: A sharpening of the Parikh mapping. RAIRO - Theor. Inf. Appl. 35(6), 551–564 (2001)

    Article  MathSciNet  Google Scholar 

  11. Mathew, L., Thomas, N., Somnath, B., Subramanian, K.G.: Some results on Parikh word representable graphs and partitions. Adv. Appl. Math. 107, 102–115 (2019)

    Article  MathSciNet  Google Scholar 

  12. Lothaire, M.: Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 17. Addison Wesley, Boston (1983)

    Google Scholar 

  13. Parikh, R.J.: On context-free languages. J. ACM 13(4), 570–581 (1966)

    Article  Google Scholar 

  14. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59136-5

    Book  MATH  Google Scholar 

  15. Salomaa, A.: Parikh matrices: subword indicators and degrees of ambiguity. In: Böckenhauer, H.-J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes. LNCS, vol. 11011, pp. 100–112. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98355-4_7

    Chapter  Google Scholar 

  16. Teh, W.C., Ng, Z.C., Javaid, M., Chern, Z.J.: Parikh word representability of bipartite permutation graphs. Discrete Appl. Math. 282, 208–221 (2020)

    Article  MathSciNet  Google Scholar 

  17. Teh, W.C.: On core words and the Parikh matrix mapping. Int. J. Found. Comput. Sci. 26(01), 123–142 (2015)

    Article  MathSciNet  Google Scholar 

  18. Teh, W.C., Kwa, K.H.: Core words and Parikh matrices. Theor. Comput. Sci. 582, 60–69 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

The authors are grateful to the reviewers for their very useful and detailed comments which helped to revise and improve the contents and presentation of the paper, correcting the errors.

Author information

Authors and Affiliations

  1. Department of Basic Sciences, Amal Jyothi College of Engineering, Kanjirappally, 686 518, Kerala, India

    Nobin Thomas & Lisa Mathew

  2. APJ Abdul Kalam Technological University, Thiruvananthapuram, 695 016, Kerala, India

    Nobin Thomas

  3. School of Advanced Sciences-Mathematics, Vellore Institute of Technology, Chennai, 600 127, Tamil Nadu, India

    Somnath Bera

  4. School of Mathematics, Computer Science and Engineering, Liverpool Hope University, Hope Park, Liverpool, L16 9JD, UK

    Atulya K. Nagar & K. G. Subramanian

Authors
  1. Nobin Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lisa Mathew
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Somnath Bera
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Atulya K. Nagar
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. K. G. Subramanian
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Porto, Porto, Portugal

    Nelma Moreira

  2. University of Porto, Porto, Portugal

    Rogério Reis

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Thomas, N., Mathew, L., Bera, S., Nagar, A.K., Subramanian, K.G. (2021). Parikh Word Representable Graphs and Morphisms. In: Moreira, N., Reis, R. (eds) Developments in Language Theory. DLT 2021. Lecture Notes in Computer Science(), vol 12811. Springer, Cham. https://doi.org/10.1007/978-3-030-81508-0_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-81508-0_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-81507-3

  • Online ISBN: 978-3-030-81508-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation