ASYMPTOTIC NUMBERS OF GENERAL 4-REGULAR GRAPHS WITH GIVEN CONNECTIVITIES
Author(s) -
Gab-Byung Chae
Publication year - 2006
Publication title -
bulletin of the korean mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 27
eISSN - 2234-3016
pISSN - 1015-8634
DOI - 10.4134/bkms.2006.43.1.125
Subject(s) - mathematics , combinatorics , asymptotic formula , discrete mathematics
Let g(n;l1;l2;d;t;q) be the number of general 4-regular graphs on n labelled vertices with l1 + 2l2 loops, d double edges, t triple edges and q quartet edges. We use inclusion and exclusion with flve types of properties to determine the asymptotic behav- ior of g(n;l1;l2;d;t;q) and hence that of g(2n), the total number of general 4-regular graphs where l1, l2, d, t and q = o( p n); re- spectively. We show that almost all general 4-regular graphs are 2-connected. Moreover, we determine the asymptotic numbers of general 4-regular graphs with given connectivities.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom