Enumeration of labelled quasi-initially connected digraphs
نویسندگان
چکیده
منابع مشابه
Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
A semicomplete multipartite or semicomplete c-partite digraph D is a biorientation of a c-partite graph. A semicomplete multipartite digraph D is called strongly quasiHamiltonian-connected, if for any two distinct vertices x and y of D, there is a path P from x to y such that P contains at least one vertex from each partite set of D. In this paper we show that every 4-strong semicomplete multip...
متن کاملEnumeration and Generation of Initially Connected Deterministic Finite Automata
The representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we present a (unique) string representation for (complete) initially-connected deterministic automata (ICDFA’s) with n states over an alphabet of k symbols. For these strings we give a regular expression and show how they are adequate for exact and random generation, allow an ...
متن کامل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.
متن کامل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$.
متن کاملEnumeration of Some Labelled Trees
In this paper we are interesting in the enumeration of rooted labelled trees according to the relationship between the root and its sons. Let Tn;k be the family of Cayley trees on n] such that the root has exactly k smaller sons. In a rst time we give a bijective proof of the fact that jTn+1;kj = ? n k n n?k. Moreover, we use the family Tn+1;0 of Cayley trees for which the root is smaller than ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00112-6