• Journal of the Korean Mathematical Society
• /
• v.42 no.6
• /
• pp.1187-1203
• /
• 2005

Let g(2n, l, d) be the number of general cubic graphs on 2n labeled vertices with l loops and d double edges. We use inclusion and exclusion with two types of properties to determine the asymptotic behavior of g(2n, l, d) and hence that of g(2n), the total number of general cubic graphs of order 2n. We show that almost all general cubic graphs are connected. Moreover, we determined the asymptotic numbers of general cubic graphs with given connectivity.

• Honam Mathematical Journal
• /
• v.32 no.1
• /
• pp.113-129
• /
• 2010

Inclusion and exclusion is used in many papers to count certain objects exactly or asymptotically. Also it is used to derive the Bonferroni inequalities in probabilistic area [6]. Inclusion and exclusion on finitely many types of properties is first used in R. Meyer [7] in probability form and first used in the paper of McKay, Palmer, Read and Robinson [8] as a form of counting version of inclusion and exclusion on two types of properties. In this paper, we provide a proof for inclusion and exclusion on finitely many types of properties in counting version. As an example, the asymptotic number of general cubic graphs via inclusion and exclusion formula is given for this generalization.