|
Search: id:A049414
|
|
|
| A049414 |
|
Number of quasi-initially connected digraphs with n labeled nodes. |
|
+0
4
|
|
| 1, 3, 54, 3804, 1022320, 1065957628, 4389587378792, 72020744942708040, 4721708591209396542528, 1237892622263984613044109216, 1298060581376190776821670648395840
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
We say that a node v of a digraph is a quasi-source iff for every other node u there exists directed path from u to v or from v to u. A digraph with at least one quasi-source is called quasi-initially connected.
|
|
REFERENCES
|
V. Jovovic and G. Kilibarda, Enumeration of labeled quasi-initially connected digraphs, Discrete Math., 224 (2000), 151-163.
|
|
FORMULA
|
The recurrence formulas are too long to be presented here.
|
|
CROSSREFS
|
Cf. A003027, A003028, A003029, A003030.
Sequence in context: A091826 A091796 A006025 this_sequence A003027 A054545 A088278
Adjacent sequences: A049411 A049412 A049413 this_sequence A049415 A049416 A049417
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladeta Jovovic, Goran Kilibarda (vladeta(AT)Eunet.yu)
|
|
|
Search completed in 0.002 seconds
|
