Sign Up to like & get
recommendations!
1
Published in 2022 at "Symmetry"
DOI: 10.3390/sym14061192
Abstract: Let DSn(d) denote the set of all doubly symmetric primitive digraphs of order n with d loops, where d is an integer and 1≤d≤n. In this paper, we determine the upper bounds for the m-competition…
read more here.
Keywords:
primitive digraphs;
generalized competition;
symmetric primitive;
competition ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2022 at "Symmetry"
DOI: 10.3390/sym14081623
Abstract: Let D be a primitive digraph of order n. The exponent of a vertex x in V(D) is denoted γD(x), which is the smallest integer q such that for any vertex y, there is a…
read more here.
Keywords:
primitive digraphs;
symmetric primitive;
exponent;
kth local ... See more keywords