Abstract
If Tc0(n) is the number of all labeled connected transitive digraphs defined on a set of n elements, then the formula Tc0(n) = S pˉ = (p1, ..., pk)| = n (-1)n-k (np) W c (pˉ) is true. The summation is over all sequences pˉ= (p1, ..., pk) ∈ ℕk1 such that p1 +...+ pk = n. Term W c (pˉ) denotes the number of labeled connected transitive digraphs of a special form, depending on the parameter pˉ.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
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.
