JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2017, Vol. 52 ›› Issue (2): 30-36.doi: 10.6040/j.issn.1671-9352.0.2016.113

Previous Articles     Next Articles

On the maximal eccentric distance sum of tree with given domination number

ZHU Xiao-ying1, PANG Shi-you2   

  1. 1. College of Jincheng, Nanjing University of Aeronautics and Astronautics, Nanjing 211156, Jiangsu, China;
    2. Department of Mathematics, China University of Mining and Technology, Xuzhou 221008, Jiangsu, China
  • Received:2016-03-14 Online:2017-02-20 Published:2017-01-18

PDF (PC)

535

Abstract: The eccentric distance sum of graph G is defined as ξd(G)=∑v∈VεG(v)DG(v), where εG(v) is the eccentricity of the vertex v and DG(v) is the sum of all distances from the vertex v. The trees having the maximal eccentric distance sum among n-vertex trees with domination number four are characterized by using the method of structure graph theory.

Key words: leavers, domination number, the eccentric distance sum

CLC Number: 

  • O157.5
[1] ORE O. Theory of graphs[M]. Providence: American Mathematical Society, 1962.
[2] GUPTA S, SINGH M, MADAN A K. Eccentric distance sum: a novel graph invariant for predicting biological and physical properties[J]. Journal of Mathematical Analysis and Applications, 2002, 275(47):386-401.
[3] YU G H, FENG L H, ILIC A. On the eccentric distance sum of trees and unicyclic graphs[J]. Journal of Mathematical Analysis and Applications, 2011, 375(1):99-107.
[4] LI S C, ZHANG M, YU G H, et al. On the extremal values of the eccentric distance sum of trees[J]. Journal of Mathematical Analysis and Applications, 2012, 390:99-112.
[5] GENG X Y, LI S C, ZHANG M. Extremal values of the eccentric distance sum of trees[J]. Discrete Applied Mathematics, 2013, 161:2427-2439.
[6] MIAO L Y, CAO Q Q, CUI N, et al. On the extremal values of the eccentric distance sum of trees[J]. Discrete Applied Mathematics, 2015, 186(29):199-206.
[7] HUA H B, XU K X, SHU W N. A short and unified proof of Yu et als two results on the eccentric distance sum[J]. Journal of Mathematical Analysis and Applications, 2011, 382:364-366.
[8] HUA H B, ZHANG S G, XU K X. Further results on the eccentric distance sum[J]. Discrete Applied Mathematics, 2012, 160:170-180.
[9] ILIC A, YU G H, FENG L H. On the eccentric distance sum of graphs[J]. Journal of Mathematical Analysis and Applications, 2011, 381:590-600.
[10] LI S C, WU Y Y, SUN L L. On the minimum eccentric distance sum of bipartite graphs with some given parameters[J]. Journal of Mathematical Analysis and Applications, 2015, 430:1149-1162.
[1] GAO Chao, HOU Xin-min*. Some remarks on maximum size of bipartite graphs with a given domination number [J]. J4, 2013, 48(8): 21-23.
[2] CHEN Hong-yu1,2, ZHANG Li3. Maximum number of edges in connected bipartite graphs with  a given domination number [J]. J4, 2012, 47(8): 11-15.
[3] YUAN Xiu-hua. The total signed domination number of complete graph [J]. J4, 2010, 45(8): 43-46.
[4] XU Lan1,2, XU Ying 1, ZHANG Li 3. Independent domination bicritical graphs [J]. J4, 2010, 45(10): 40-44.
[5] WANG Bing . Properties of a quasi-claw-free graph [J]. J4, 2007, 42(10): 111-113 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd