Abstract
A two-colored directed digraph D is primitive if and only if there exist nonnegative integers h and k with h+k>0 such that for each pair (i,j) of vertices there is a (h,k)-walk in D from i to j. The exponent of the primitive two-colored digraph D is defined to be the smallest value of h+k over all suchand . With the knowledge of graph theory, a class of two-colored digraphs with two cycles whose uncolored digraph has 3n vertices and consists of one (2n+1)-cycle and one n-cycle is considered.The exponent bound, exponent set and characteristic of extral two-colored digraphs are given.
Sign-in/Register to access full text options 
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.
