2 citations · 3 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2022★ 1 cited
On the main distance-based entropies: the eccentricity- and Wiener-entropy
Stijn Cambie, Yanni Dong
We define the Wiener-entropy, which is together with the eccentricity-entropy one of the most natural distance-based graph entropies. By deriving the (asymptotic) extremal behaviou…
math.CO2022
Extremal values of degree-based entropies of bipartite graphs
Stijn Cambie, Yanni Dong, Matteo Mazzamurro
We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The ext…
math.CO2021
Graphs with minimum degree-based entropy
Yanni Dong, Maximilien Gadouleau, Pengfei Wan +1
The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees.…