| Popis: |
Let G be a simple connected graph. The eccentric distance sum (EDS) of G is defined as ξ d ( G ) = ∑ v ∈ V e G ( v ) D G ( v ) , where e G ( v ) is the eccentricity of the vertex v and D G ( v ) = ∑ u ∈ V d G ( u , v ) is the sum of all distances from the vertex v . In this paper, the trees having the maximal EDS among n -vertex trees with maximum degree Δ and among those with domination number 3 are characterized. The trees having the maximal or minimal EDS among n -vertex trees with independence number α and the trees having the maximal EDS among n -vertex trees with matching number m are also determined. |
Full Text from ScienceDirect