2 problems
Let be a graph of order , and let denote its eccentricity-entropy. An extremal graph is one attaining the minimum value of this entropy. The minimum eccentricit…
Wiener–eccentricity monotonicity conjecture. For every such edge ,
Let be a graph of order , and let denote its eccentricity-entropy. An extremal graph is one attaining the minimum value of this entropy. The minimum eccentricit…
Wiener–eccentricity monotonicity conjecture. For every such edge ,