Open Access Library Journal

Volume 4, Issue 7 (July 2017)

ISSN Print: 2333-9705   ISSN Online: 2333-9721

Google-based Impact Factor: 0.47  Citations  

Sharp Upper Bounds for Multiplicative Degree Distance of Graph Operations

HTML  XML Download Download as PDF (Size: 459KB)  PP. 1-18  
DOI: 10.4236/oalib.1102987    339 Downloads   605 Views  

ABSTRACT

In this paper, multiplicative version of degree distance of a graph is defined and tight upper bounds of the graph operations have been found.

Share and Cite:

Muruganandam, R. , Manikandan, R. and Aruvi, M. (2017) Sharp Upper Bounds for Multiplicative Degree Distance of Graph Operations. Open Access Library Journal, 4, 1-18. doi: 10.4236/oalib.1102987.

Cited by

No relevant information.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.