The Edge-Weighted Graph Entropy Using Redefined Zagreb Indices

Jing Lu, Hafiz Mutee-ur-Rehman, Saima Nazeer, Xuemei An and Tabasam Rashid

Mathematical Problems in Engineering, 2022, vol. 2022, 1-12

Abstract: Measurements of graphs and retrieving structural information of complex networks using degree-based network entropy have become an informational theoretical concept. This terminology is extended by the concept of Shannon entropy. In this paper, we introduce entropy with graphs having edge weights which are basically redefined Zagreb indices. Some bounds are calculated to idealize the performance in limiting different kinds of graph entropy. In addition, we discuss the structural complexity of connected graphs representing chemical structures. In this article, we have discussed the edge-weighted graph entropy with fixed number of vertices, with minimum and maximum degree of a vertex, regular graphs, complete graphs, complete bipartite graphs, and graphs associated with chemical structures.

Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/5958913.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/5958913.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:5958913

DOI: 10.1155/2022/5958913

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().