• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter
Journal of Algorithms and Computation
Articles in Press
Current Issue
Journal Archive
Volume Volume 51 (2019)
Volume Volume 50 (2018)
Issue issue 2
Summer and Autumn 2018
Issue Issue 1
June 2018
Volume Volume 49 (2017)
Volume Volume 48 (2016)
Volume Volume 47 (2016)
Volume Volume 46 (2015)
Volume Volume 45 (2014)
Volume Volume 44 (2013)
Volume Volume 43 (2009)
Volume Volume 42 (2008)
Volume Volume 41 (2007)
Muruganandam, R., Manikandan, R., Aruvi, M. (2018). Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs. Journal of Algorithms and Computation, 50(1), 1-28.
R. Muruganandam; R.S. Manikandan; M.Aruvi Aruvi. "Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs". Journal of Algorithms and Computation, 50, 1, 2018, 1-28.
Muruganandam, R., Manikandan, R., Aruvi, M. (2018). 'Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs', Journal of Algorithms and Computation, 50(1), pp. 1-28.
Muruganandam, R., Manikandan, R., Aruvi, M. Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs. Journal of Algorithms and Computation, 2018; 50(1): 1-28.

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

Article 1, Volume 50, Issue 1, June 2018, Page 1-28  XML PDF (294.87 K)
Document Type: Research Paper
Authors
R. Muruganandam1; R.S. Manikandan2; M.Aruvi Aruvi3
1Department of Mathematics, Government Art College,Tiruchirappalli
2Department of Mathematics, Bharathidasan University Constituent College, Lalgudi, Tiruchirappalli
3Department of Mathematics, Anna University, Tiruchirappalli, India
Abstract
In $1994,$ degree distance  of a graph was introduced by Dobrynin
, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative version of  Gutman index of cartesian product of two connected graphs. And we compute the exact value for the cartesian product of two complete graphs. Using this result, we prove that our bound is tight. Also, we obtain the sharp upper bound for the multiplicative version of degree distance and the multiplicative version of Gutman index of strong product of connected and complete graphs. And we observe the exact value for the strong product of two complete graphs. From this,  we prove that our bound is tight.
Keywords
Topological indices; Vertex degree; Cartesian product and Strong product
Statistics
Article View: 230
PDF Download: 338
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

This work is licensed under a Creative Commons Attribution 4.0 International License
Journal Management System. Designed by sinaweb.