Advances and Applications in Discrete Mathematics
Volume 5, Issue 1, Pages 77 - 83
(January 2010)
|
|
THE ASCENDING PROPERTY OF THE LOWER MULTIEXPONENT SETS FOR PRIMITIVE DIGRAPHS
Min Tan, Shexi Chen, Jianxun Liu and Jian Lin
|
Abstract: A digraph D
(loops are permitted but no multiple arcs) is called primitive if there exists
an integer k such that for every
vertex u and every vertex v,
there is a walk of length k from u to v. In this paper, we
give the ascending property of the lower multiexponent sets of a special class
of primitive digraphs and provide a new proof of the theorem on the lower
multiexponent sets by applying this property. |
Keywords and phrases: lower multiexponent, lower multiexponent set, primitive digraph. |
|
Number of Downloads: 291 | Number of Views: 808 |
|