中文

图的Steiner 4-直径

组合数学 2017-02-21 v1

摘要

图的Steiner距离由Chartrand、Oellermann、Tian和Zou于1989年引入,是经典图距离概念的自然推广。对于阶至少为22的连通图GGSV(G)S\subseteq V(G)SS的顶点间的Steiner距离dG(S)d_G(S)是包含所有SS的顶点集的所有连通子图的最小大小。设n,kn,k为两个整数且2kn2\leq k\leq n。则GG的顶点vv的Steiner kk-离心率ek(v)e_k(v)定义为ek(v)=max{d(S)SV(G), S=k, 且 vS}e_k(v)=\max \{d(S)\,|\,S\subseteq V(G), \ |S|=k, \ 且 \ v\in S \}。进而,GG的Steiner kk-直径为sdiamk(G)=max{ek(v)vV(G)}sdiam_k(G)=\max \{e_k(v)\,|\,v\in V(G)\}。2011年,Chartrand、Okamoto和Zhang证明了k1sdiamk(G)n1k-1\leq sdiam_k(G)\leq n-1。本文中,分别刻画了满足sdiam4(G)=3,4,n1sdiam_4(G)=3,4,n-1的图。

关键词

引用

@article{arxiv.1702.05681,
  title  = {The Steiner 4-diameter of a graph},
  author = {Zhao Wang and Yaping Mao and Hengzhe Li and Chengfu Ye},
  journal= {arXiv preprint arXiv:1702.05681},
  year   = {2017}
}

备注

18 pages, 2 figures. arXiv admin note: text overlap with arXiv:1509.02801