2022
DOI: 10.1155/2022/5958913
|View full text |Cite
|
Sign up to set email alerts
|

The Edge-Weighted Graph Entropy Using Redefined Zagreb Indices

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 29 publications
0
1
0
Order By: Relevance
“…In the wind farm graph structure, every node has different degrees and every connection has different weights [28]. The nodes in the center graph have higher values of degrees than the nodes on the edge.…”
Section: Graph Weighting Calculation Based On Micmentioning
confidence: 99%
“…In the wind farm graph structure, every node has different degrees and every connection has different weights [28]. The nodes in the center graph have higher values of degrees than the nodes on the edge.…”
Section: Graph Weighting Calculation Based On Micmentioning
confidence: 99%