The kth Upper Bases of Primitive Non-powerful Signed Digraphs
Combinatorics
2009-07-08 v1
Abstract
In this paper, we study the kth upper bases of primitive non-powerful signed digraphs. A bound on the kth upper bases of all primitive non-powerful signed digraphs is obtained, and the equality case of the bound is characterized. We also show that there exists "gap" in the kth upper base set of primitive non-powerful signed digraphs.
Cite
@article{arxiv.0907.1122,
title = {The kth Upper Bases of Primitive Non-powerful Signed Digraphs},
author = {Yanling Shao and Jian Shen and Yubin Gao},
journal= {arXiv preprint arXiv:0907.1122},
year = {2009}
}
Comments
8 Pages