Primitive Exponents of a Class of Two-colored Digraphs
Jianzhong Wang · Journal of Electric Power · 2008
A special two-colored digraph with two cycles was considered,whose uncolored digraph consists of onecycle and one cycle.Using the method of combinatorial matrix theory and graph theory,the primitivity conditions and the upper bound on the exponent wer given.Further,the extremal digraphs that meet the upper bound were characterized.