Abstract
For an arc-colored digraph D, we say D is properly strongly connected, if for any ordered pair of vertices (x, y), D contains a directed path from x to y such that any adjacent arcs in that path have distinct colors. The directed proper connection number pc→(D) of a digraph D, is the minimum number of colors to make D properly strongly connected. Let D(n, p) denote the random digraph model, in which every arc of a digraph is chosen with probability p independently from other arcs. We prove that if p={logn+loglogn+λ(n)}/n, then with high probability, pc→(D(n,p))=2, where λ(n) tends to infinite.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.