@article {IOPORT.05717253,
    author       = {Suwilo, Saib},
    title        = {Notes on exponents of asymmetric two-colored digraphs.},
    year         = {2009},
    journal      = {JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing},
    volume       = {71},
    issn         = {0835-3026},
    pages        = {243-256},
    publisher    = {Charles Babbage Research Centre, Winnipeg},
    abstract     = {Summary: We discuss an upper bound for exponents of loopless asymmetric two-colored digraphs. If $D$ is an asymmetric primitive two-colored digraph on $n$ vertices, we show that $\exp(D)\le 3n^2+2n-2$. For an asymmetric two-colored digraph $D$ which contains a primitive two-colored cycle of length $s\le n$, we show its exponent is at most $(s^2-1)/2+ (s+1)(n-s)$. We characterize such two-colored digraphs whose exponents equal $(s^2-1)/2+ (s+1)(n-s)$ and show that the largest exponent of asymmetric two-colored digraph lies on the interval $[(n^2-1)/2, 3n^2+2n-2]$ when $n$ is odd, or $[n^2/2,3n^2+2n-2]$ otherwise.},
    identifier   = {05717253},
}