Generalized exponents of primitive directed graphs

Generalized exponents of primitive directed graphs
复制标题

DOI:
10.1002/jgt.3190140413
复制
发表时间:
1990-07
期刊:
J. Graph Theory
影响因子:
--
通讯作者:
R. Brualdi;Bolian Liu
R. Brualdi;Bolian Liu
中科院分区:
其他
文献类型:
--
作者:
R. Brualdi;Bolian Liu

文献摘要

被引文献

相似文献

本原有向图的指数是最小的整数t,使得对于每个有序的顶点对(不一定是不同的)x和y,存在从x到y的长度为t的路径。有相当多的信息已知的界限指数和那些数字,可以是指数的本原有向图的n个顶点。我们引入了一些新的参数相关的指数,并得到这些参数的界。
The exponent of a primitive digraph is the smallest integer t such that for each ordered pair of (not necessarily distinct) vertices x and y there is a path of length t from x to y. There is considerable information known about bounds on exponents and those numbers that can be exponents of primitive digraphs with n vertices. We introduce some new parameters related to the exponent and obtain bounds on these parameters.