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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
