全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

Sharp Upper Bounds for Multiplicative Degree Distance of Graph Operations

DOI: 10.4236/oalib.1102987, PP. 1-18

Subject Areas: Discrete Mathematics

Keywords: Join, Disjunction, Composition, Symmetric Difference, Multiplicative Degree Distance, Zagreb Indices and Coindices

Full-Text   Cite this paper   Add to My Lib

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.

Cite this paper

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

References

[1]  Dobrynin, A.A. and Kochetova, A.A. (1994) Degree Distance of a Graph: A Degree Analogue of the Wiener Index. Journal of Chemical Information and Computer Sciences, 34, 1082-1086.
https://doi.org/10.1021/ci00021a008
[2]  Gutman, I. (1994) Selected Properties of the Schultz Molecular Topological Index. Journal of Chemical Information and Computer Sciences, 34, 1087-1089.
[3]  Gutman, I. and Trinajstic, N. (1972) Graph Theory and Moleclar Orbitals. Total pi-Electron Energy of Alternant Hydrocarbons. Chemical Physics Letters, 17, 535- 538.
[4]  Devillers, J. and Balaban, A.T. (1999) Topological Indices and Related Descriptors in QSAR and QSPR. Gordon and Breach, Amsterdam, The Netherlands.
[5]  Doslic, T. (2008) Vertex-Weighted Wiener Polynomials for Composite Graphs. Ars Mathematica Contemporanea, 1, 66-80.
[6]  Ashrafi, A.R., Doslic, T. and Hamzeha, A. (2010) The Zagreb Coindices of Graph Operations. Discrete Applied Mathematics, 158, 1571-1578.
https://doi.org/10.1016/j.dam.2010.05.017
[7]  Ashrafi, A.R., Doslic, T. and Hamzeha, A. (2011) Extremal Graphs with Respect to The Zagreb Coindices, MATCH Commun. Math. Comput. Chem., 65, 85-92.
[8]  Hamzeha, A., Iranmanesh, A., Hossein-Zadeh, S. and Diudea, M.V. (2012) Generalized Degree Distance of Trees, Unicyclic and Bicyclic Graphs. Studia Ubb Chemia, LVII, 4, 73-85.
[9]  Hamzeha, A., Iranmanesh, A. and Hossein-Zadeh, S. (2013) Some Results on Generalized Degree Distance. Open Journal of Discrete Mathematics, 3, 143-150.
https://doi.org/10.4236/ojdm.2013.33026
[10]  Imrich, W. and Klavzar, S. (2000) Product Graphs: Structure and Recognition. John Wiley and Sons, New York.
[11]  Kahlifeh, M.H., Yousefi-Azari, H. and Ashrafi, A.R. (2008) The Hyper-Wiener Index of Graph Operations. Computers and Mathematics with Applications, 56, 1402- 1407.
https://doi.org/10.1016/j.camwa.2008.03.003

Full-Text


comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413