The Entropy of Weighted Graphs with Atomic Bond Connectivity Edge Weights

Young Chel Kwun; Hafiz Mutee ur Rehman; Muhammad Yousaf; Waqas Nazeer; Shin Min Kang

doi:10.1155/2018/8407032

Discrete Dynamics in Nature and Society (Jan 2018)

The Entropy of Weighted Graphs with Atomic Bond Connectivity Edge Weights

Young Chel Kwun,
Hafiz Mutee ur Rehman,
Muhammad Yousaf,
Waqas Nazeer,
Shin Min Kang

Affiliations

Young Chel Kwun: Department of Mathematics, Dong-A University, Busan 49315, Republic of Korea
Hafiz Mutee ur Rehman: Division of Science and Technology, University of Education Lahore 54000, Pakistan
Muhammad Yousaf: Department of Mathematics, COMSATS University Islamabad, Lahore, Campus, Lahore 54000, Pakistan
Waqas Nazeer: Division of Science and Technology, University of Education Lahore 54000, Pakistan
Shin Min Kang: Department of Mathematics and RINS, Gyeongsang National University, Jinju 52828, Republic of Korea

DOI: https://doi.org/10.1155/2018/8407032
Journal volume & issue: Vol. 2018

Abstract

Read online

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.

Published in Discrete Dynamics in Nature and Society

ISSN: 1026-0226 (Print); 1607-887X (Online)
Publisher: Wiley
Country of publisher: United Kingdom
LCC subjects: Science: Mathematics
Website: https://onlinelibrary.wiley.com/journal/3059

About the journal