On extremal cacti with respect to the first degree-based entropy
Let be a simple graph with degree sequence . The first degree-based entropy of is defined as . In this article, we give sharp upper and lower bounds for the first degree-based entropy of graphs in and characterize the corresponding extremal graphs when each bound is attained, where is the set of all...
Gespeichert in:
| Veröffentlicht in: | Open mathematics (Warsaw, Poland) Poland), 2023-09, Vol.21 (1), p.229-235 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Let
be a simple graph with degree sequence
. The first degree-based entropy of
is defined as
. In this article, we give sharp upper and lower bounds for the first degree-based entropy of graphs in
and characterize the corresponding extremal graphs when each bound is attained, where
is the set of all cacti with
vertices and
cycles. |
|---|---|
| ISSN: | 2391-5455 2391-5455 |
| DOI: | 10.1515/math-2023-0108 |