全有向图的幂敛指数(英文)

CORC > 集美大学

	全有向图的幂敛指数(英文)
	晏卫根 ; 张福基
刊名	http://epub.edu.cnki.net/grid2008/brief/detailj.aspx?filename=ycxx200204008&dbcode=CJFQ&dbname=CJFQ2002
	2012-06-05 ; 2012-06-05
关键词	线有向图全有向图幂敛指数周期邻接矩阵 Line digraph Total digraph Index of convergence Period Adjacency matrix. O157.5
其他题名	The Index of Convergence of the Total Digraph
中文摘要	设D为有向图,T(D)为D的全有向图(Total-digraph),k(D)与p(D)分别为D的幂敛指数(Index of convergence)与周期(Period).本文证明了,1.对任意非平凡有向图D,p(T(D))=1,k(T(D))≤max{2p(D)-1,2k(D)+1},特别地,当D为本原有向图时,k(T(D))≤k(D)+1;当D不含有向圈时,k(T(D))=2k(D)-1;当D为有向圈C_n时,k(T(D))=2n-1.2.对任意非平凡强连通图D,k(T(D))≥Diam(D)+1.我们还证明了以上界是不可改进的最好界.; Let D be a digraph, T(D) denote the total digraph of D, k(D) and p(D) denote the index of convergence and the period of D, respectively. Following results are obtained in this paper: 1. For a non-trivial digraph D, then p(T(D)) = 1, and k(T(D)) ≤ max{2p(D) -1,2k(D) + 1}. Especially, we prove that k(T(D)) ≤ k(D) + 1 if D is a primitive digraph; and k(T(D)) = 2k(D) - 1 if there are not directed cycles in D; and k(T(D)) = 2_n - 1 if D is a directed cycle C_n. 2. For a strongly connected digraph D, then k(T(D)) ≥ Diam(D) + 1, where Diam(D) denotes the diameter of D. We also proved that these bounds are best.; 【作者单位】集美大学师范学院数学系；厦门大学数学系厦门 361021；厦门 361005；【作者英文名】WEIGEN YAN FUJI ZHANG(Department of Mathematics, Xiamen University, Xiamen 361005, China)
语种	中文
内容类型	期刊论文
源URL	[http://ir.calis.edu.cn/hdl/235041/15792]
专题	集美大学
推荐引用方式 GB/T 7714	晏卫根,张福基. 全有向图的幂敛指数(英文)[J]. http://epub.edu.cnki.net/grid2008/brief/detailj.aspx?filename=ycxx200204008&dbcode=CJFQ&dbname=CJFQ2002,2012, 2012.
APA	晏卫根,&张福基.(2012).全有向图的幂敛指数(英文).http://epub.edu.cnki.net/grid2008/brief/detailj.aspx?filename=ycxx200204008&dbcode=CJFQ&dbname=CJFQ2002.
MLA	晏卫根,et al."全有向图的幂敛指数(英文)".http://epub.edu.cnki.net/grid2008/brief/detailj.aspx?filename=ycxx200204008&dbcode=CJFQ&dbname=CJFQ2002 (2012).