| The k-point Exponent Set of Primitive Digraphs with Girth 2 |
| |
| 作者单位： | She-xi Chen~1 Wei-jun Liu~2 Jin-wang Liu~1 1 School of Mathematics and Computational Science，Hunan University of Science and Technology，Xiangtan 411201 China 2 School of Mathematics Sciences and Computing Technology，Central South University，Changsha 410075，China |
| |
| 摘 要： | Let D =(V,E)be a primitive digraph.The vertex exponent of D at a vertex v∈V,denoted by exPD(V),is the least integer p such that there is a v→u walk of length p for each u∈V.Following Brualdi and Liu,we order the vertices of D so that exPD(v_1)≤exPD(v_2)≤…≤exPD(v_n).Then exPD(v_k)is called the k- point exponent of D and is denoted by exP_D(k),1≤k≤n.In this paper we define e(n,k):=max{exp_D(k)|D∈PD(n,2)} and E(n,k):= {expD(k)|D∈PD(n,2)},where PD(n,2)is the set of all primitive digraphs of order n with girth 2.We completely determine e(n,k)and E(n,k)for all n,k with n≥3 and 1≤k≤n.
|
| 关 键 词： | 基本双图 K点指数 指数集 周长 |
The k-point Exponent Set of Primitive Digraphs with Girth 2 |
| |
| Authors: | She-xi Chen Wei-jun Liu Jin-wang Liu |
| |
| Institution: | [1]School of Mathematics and Computational Science, Hunan University of Science and Technology, Xiangtan411201 China [2]School of Mathematics Sciences and Computing Technology, Central South University, Changsha 410075, China |
| |
| Abstract: | |
| |
| Keywords: | Primitive digraph k-point exponent exponent set |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
