Photo by floschmaezz from unsplash
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… Click to show full 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 indices(generalized competition indices) of DSn(d), where 1≤m≤n. If n and d satisfy that n is odd and d is odd, or n≤2d−2 and d is even such that d≥2, then the upper bounds for the m-competition indices of DSn(d) can be reached, where 1≤m≤n.
Keywords:
primitive digraphs;
generalized competition;
symmetric primitive;
competition;
competition indices;
doubly symmetric
Journal Title: Symmetry
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Symmetry
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!