The Entropy of Weighted Graphs with Atomic Bond Connectivity Edge Weights

12Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The aim of this report to solve the open problem suggested by Chen et al. We study the graph entropy with ABC edge weights and present bounds of it for connected graphs, regular graphs, complete bipartite graphs, chemical graphs, tree, unicyclic graphs, and star graphs. Moreover, we compute the graph entropy for some families of dendrimers.

Cite

CITATION STYLE

APA

Kwun, Y. C., Rehman, H. M. U., Yousaf, M., Nazeer, W., & Kang, S. M. (2018). The Entropy of Weighted Graphs with Atomic Bond Connectivity Edge Weights. Discrete Dynamics in Nature and Society, 2018. https://doi.org/10.1155/2018/8407032

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free