Skip to main content
SpringerLink
Log in

Monophonic Distance Based Indices of Graphs

  • Conference paper
  • First Online:
Book cover Computational Statistics and Mathematical Modeling Methods in Intelligent Systems (CoMeSySo 2019 2019)

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

Included in the following conference series:

  • 500 Accesses

Abstract

The monophonic distance matrix of a simple connected graph G(p, q) is a square matrix of order p whose entries are the monophonic distances. In this paper the monophonic indices of cycle graph, wheel graph, ladder graph and circular ladder graph are determined by forming the monophonic polynomial from the corresponding monophonic distance matrices of graphs.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Arul Paul Sudhahar, P., Little Flower, M.: Total edge detour monophonic number of a graph (2019). https://doi.org/10.29055/jcms/1004

    Article  Google Scholar 

  2. Arumugam, S.: The upper connected vertex detour monophonic number of a graph. Indian J. Pure Appl. Math. 49(2), 365–379 (2018)

    Article  MathSciNet  Google Scholar 

  3. Titus, P., Ganesamoorthy, K.: Upper detour monophonic number of a graph. Electron. Notes Discret. Math. 53, 331–342 (2016)

    Article  MathSciNet  Google Scholar 

  4. Titus, P., Ganesamoorthy, K.: On the detour monophonic number of a graph. Ars Comb. 129, 33–42 (2016)

    MathSciNet  MATH  Google Scholar 

  5. Santhakumaran, A.P., Titus, P.: A note on “monophonic distance in graphs”. Discret. Math. Algorithms Appl. 4(2), 1250018 (2012)

    Article  Google Scholar 

  6. Santhakumaran, A.P., Titus, P.: Monophonic distance in graphs. Discret. Math. Algorithms Appl. 3(2), 159–169 (2011)

    Article  MathSciNet  Google Scholar 

  7. Kathiresan, K.M., et al.: Detour wiener indices of graphs. Bull. ICA 62, 33–47 (2011)

    MathSciNet  MATH  Google Scholar 

  8. Kaladevi, V., Backialakshmi, P.: Detour distance polynomial of double star graph and cartesian product of P2 × Cn. Antarct. J. Math. 8(5), 399–406 (2011)

    Google Scholar 

  9. Chantrand, G., Zhang, P.: Distance in graphs, taking the longview AKCE. J. Graphs Combin. 1, 1–13 (2004)

    Google Scholar 

  10. Furtula, B., et al.: Wiener-type topological indices of phenyleness. Indian J. Chem. 41 A(9), 1767–1772 (2002)

    Google Scholar 

  11. Lukovits, L.: The detour index. Croat. Chem. Acta 69, 873–882 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hindustan Institute of Technology and Science, Chennai, 603 103, Tamil Nadu, India

    V. Kaladevi & G. Kavitha

Authors
  1. V. Kaladevi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Kavitha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. Kavitha .

Editor information

Editors and Affiliations

  1. Faculty of Applied Informatics, Tomas Bata University in Zlin, Zlin, Czech Republic

    Radek Silhavy

  2. Faculty of Applied Informatics, Tomas Bata University in Zlin, Zlin, Czech Republic

    Petr Silhavy

  3. Faculty of Applied Informatics, Tomas Bata University in Zlin, Zlin, Czech Republic

    Zdenka Prokopova

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kaladevi, V., Kavitha, G. (2019). Monophonic Distance Based Indices of Graphs. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Computational Statistics and Mathematical Modeling Methods in Intelligent Systems. CoMeSySo 2019 2019. Advances in Intelligent Systems and Computing, vol 1047. Springer, Cham. https://doi.org/10.1007/978-3-030-31362-3_24

Download citation

Publish with us

Policies and ethics

Search

Navigation