On extremal cacti with respect to the first degree-based entropy
Let GG be a simple graph with degree sequence D(G)=(d1,d2,…,dn)D\left(G)=\left({d}_{1},{d}_{2},\ldots ,{d}_{n}). The first degree-based entropy of GG is defined as I1(G)=ln∑i=1ndi−1∑i=1ndi∑i=1n(dilndi){I}_{1}\left(G)=\mathrm{ln}{\sum }_{i=1}^{n}{d}_{i}-\frac{1}{{\sum }_{i=1}^{n}{d}_{i}}{\sum }_{i=1}...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2023-09-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2023-0108 |