Asymptotic enumeration of strongly connected digraphs by vertices and edges
نویسندگان
چکیده
We derive an asymptotic formula for the number of strongly connected digraphs with n vertices and m arcs (directed edges), valid for m − n → ∞ as n → ∞ provided m = O(n log n). This fills the gap between Wright’s results which apply to m = n+O(1), and the long-known threshold for m, above which a random digraph with n vertices and m arcs is likely to be strongly connected.
منابع مشابه
The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges
Edward A. Benderl Depariment of Mathel1wtics, University of California, San Diego, La Jolla, CA 92093, USA E. Rodney Canfieldl Department of Computer Science, University of Georgia, Athens, GA 30602, USA Brendan D. McKay2 Computer Science Department, Australian National University, GPO Box 4, ACT 2601., Australia In a recent paper, we determined the asymptotic number of labelled connected graph...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملAsymptotic enumeration of Eulerian digraphs with multiple edges
2. Main result. By an eulerian digraph we mean a digraph in which the in-degree is equal to the out-degree at each vertex. Let ED ME ( n, t) be the number of labelled loop-free eulerian digraphs with n vertices in which the multiplicity of each edge is at most t. Allowing loops would multiply ED ME (n, t) by exactly (t + 1) n, since loops do not affect the eulerian property. For the case where ...
متن کاملPushing Vertices and Orienting Edges
William F. Klostermeyer Dept. Statistics and Computer Science West Virginia University Morgantown, WV 26506-6330 e-mail: [email protected] ABSTRACT A directed graph operation called pushing a vertex is studied. When a vertex is pushed, the orientation of each of its incident edges is reversed. We consider the problems of pushing vertices so as to produce strongly connected, semi-connected, and acy...
متن کاملLinear Sphericity Testing of 3-Connected Single Source Digraphs
It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 43 شماره
صفحات -
تاریخ انتشار 2013