On extremal cacti with respect to the first degree-based entropy
From MaRDI portal
Publication:6083269
DOI10.1515/math-2023-0108zbMath1523.05022OpenAlexW4386735934MaRDI QIDQ6083269
Weimin Li, Wei-Hua He, Jianbin Zhang, Jianping Li
Publication date: 31 October 2023
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2023-0108
Extremal problems in graph theory (05C35) Measures of information, entropy (94A17) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremality of degree-based graph entropies
- A history of graph entropy measures
- Information processing in complex networks: Graph entropy and information functionals
- Maximum values of degree-based entropies of bipartite graphs
- Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs
- First degree-based entropy of graphs
- A note on distance-based graph entropies
- On graph entropy measures based on the number of independent sets and matchings
- Mathematical Foundations and Applications of Graph Entropy
- Graph Operations Decreasing Values of Degree-Based Graph Entropies
- A note on extremality of the first degree-based entropy
This page was built for publication: On extremal cacti with respect to the first degree-based entropy