The kth Upper Bases of Primitive Non-powerful Signed Digraphs
classification
🧮 math.CO
keywords
digraphsnon-powerfulprimitivesignedupperbasesboundbase
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.