连通图平均距离的界
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Bounds on the Average Distance in Connected Graphs
  • 作者:郝国亮 ; 谢智红 ; 张家骥
  • 英文作者:HAO Guo-liang;XIE Zhi-hong;ZHANG Jia-ji;School of Science,East China University of Technology;
  • 关键词:总距离 ; 平均距离 ; 连通图
  • 英文关键词:total distance;;average distance;;connected graph
  • 中文刊名:HDDZ
  • 英文刊名:Journal of East China University of Technology(Natural Science)
  • 机构:东华理工大学理学院;
  • 出版日期:2017-12-31
  • 出版单位:东华理工大学学报(自然科学版)
  • 年:2017
  • 期:v.40;No.140
  • 基金:江西省教育厅科学技术研究项目(GJJ150561);; 东华理工大学博士科研启动基金项目(DHBK2015319,DHBK2015320)
  • 语种:中文;
  • 页:HDDZ201704015
  • 页数:3
  • CN:04
  • ISSN:36-1300/N
  • 分类号:98-100
摘要
图的距离和是指连通图中所有顶点间的距离之和,与之密切相关的另一个参数是平均距离,它是指连通图的距离和的平均值。连通图的σ(u)指标定义为图中顶点u与图中所有顶点间的距离之和。利用图的σ(u)指标得到了连通图的平均距离的若干上下界,这些界与图的顶点数、边数、直径和半径等密切相关。
        The sum of the distance of a graph is the sum of the distances over all pairs of vertices in the connected graph. Another parameter closely related to this is the average distance,which is defined to be the average value of the sum of the distance. Let σ( u) denote the sum of the distance between the vertex u of the connected graph and all of the vertices of the graph. By making use of this parameter,some lower and upper bounds on the average distance of connected graphs are given,which are closely connected with the numbers of vertices and edges,diameter and radius of graphs.
引文
卢永红,康淑瑰,孟献青.2013.两类特殊树的距离和及平均距离[J].中北大学学报:自然科学版,34(5):496-499.
    卢永红,刘宏英.2010.几类树的距离和及平均距离[J].山西师范大学学报:自然科学版,24(2):16-19.
    周涛,徐俊明,刘隽.2004.图直径与平均距离的极值问题研究[J].中国科学技术大学学报,34(4):410-413.
    Chung F R K.1988.The average distance and the independence number[J].Journal of Graph theory,12:229-235.
    Dankelmann P.2000.Entringer R.Average distance,minimum degree,and spanning trees[J].Journal of Graph Theory,33(1):1-13.
    Dankelmann P,Oellermann O R,Wu J L.2004.Minimum average distance of strong orientations of graphs[J].Discrete Applied Mathematics,143:204-212.
    Doyle J K.1977.Mean distance in a graph[J].Discrete Math.,17:147-154.
    Plesnik J.1984.On the sum of all distances in a graph or digraph[J].J.Graph Theory,8:1-21.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700