树的最大离心距离和
On the Maximal Eccentric Distance Sum of Tree
DOI: 10.12677/AAM.2017.64060, PDF, HTML, XML, 下载: 1,484  浏览: 3,465 
作者: 吴晓菲, 陈学刚：华北电力大学数理学院，北京
关键词: 树；离心率；离心距离和；Tree； Eccentricity； The Eccentric Distance Sum
摘要: 设G图是一个简单连通图，图G的离心距离和定义为，其中表示顶点ν的离心率，表示在图G中顶点ν到其它所有顶点的距离和。本文刻画了控制数为γ且具有最大离心距离和的树的结构。该结论是若干已有成果的推广。
Abstract: Let G be a connected graph. The eccentric distance sum of graph G is defined as , where is the eccentricity of the vertex ν and is the sum of all distances from the vertex ν. In this paper, we characterize the tree with domination number γ and the maximal eccentric distance sum. Some known results have been extended.
文章引用：吴晓菲, 陈学刚. 树的最大离心距离和[J]. 应用数学进展, 2017, 6(4): 504-507. https://doi.org/10.12677/AAM.2017.64060

参考文献

[1] Geng, X.Y., Li, S.C. and Zhang, M. (2013) Extremal Values of the Eccentric Distance Sum of Trees. Discrete Applied Mathematics, 161, 2427-2439. https://doi.org/10.1016/j.dam.2013.05.023
[2] Hua, H.B., Xu, K.X. and Shu, W.N. (2011) A Short and Unified Proof of Yu et al’s Two Results on the Eccentric Distance Sum. Journal of Mathematical Analysis and Applications, 382, 364-366. https://doi.org/10.1016/j.jmaa.2011.04.054
[3] Miao, L.Y., Cao, Q.Q. and Cui, N. (2015) On the Extremal Values of the Eccentric Distance Sum of Trees. Discrete Applied Mathematics, 186, 199-206. https://doi.org/10.1016/j.dam.2015.01.042
[4] 朱晓颖, 逄世友. 控制数给定的树的最大离心距离和[J]. 山东大学学报(理学版), 2017, 52(2): 30-36.

为你推荐