Enumeration and limit laws for series–parallel graphs
نویسندگان
چکیده
منابع مشابه
Enumeration and limit laws for series-parallel graphs
We show that the number gn of labelled series–parallel graphs on n vertices is asymptotically gn ∼ g · n−5/2γ nn!, where γ and g are explicit computable constants. We show that the number of edges in random series–parallel graphs is asymptotically normal with linear mean and variance, and that it is sharply concentrated around its expected value. Similar results are proved for labelled outerpla...
متن کاملAsymptotic enumeration and limit laws for graphs of fixed genus
It is shown that the number of labelled graphs with n vertices that can be embedded in the orientable surface Sg of genus g grows asymptotically like cnγn! where c > 0, and γ ≈ 27.23 is the exponential growth rate of planar graphs. This generalizes the result for the planar case g = 0, obtained by Giménez and Noy. An analogous result for non-orientable surfaces is obtained. In addition, it is p...
متن کاملEnumeration and Limit Laws of Series-parallel Graphs
We show that the number gn of labelled series-parallel graphs on n vertices is asymptotically gn ∼ g · n−5/2γnn!, where γ and g are explicit computable constants. We show that the number of edges in random seriesparallel graphs is asymptotically normal with linear mean and variance, and that it is sharply concentrated around its expected value. Similar results are proved for labelled outerplana...
متن کاملAsymptotic Enumeration and Limit Laws of Planar Graphs
A graph is planar if it can be embedded in the plane, or in the sphere, so that no two edges cross at an interior point. A planar graph together with a particular embedding is called a map. There is a rich theory of counting maps, started by Tutte in the 1960’s. However, in this paper we are interested in counting graphs as combinatorial objects, regardless of how many nonequivalent topological...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2007
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2007.04.011