Counting cubic graphs

Numbers of cubic graphs

✍ R. W. Robinson; N. C. Wormald 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB

## Abstract The numbers of unlabeled cubic graphs on __p = 2n__ points have been found by two different counting methods, the best of which has given values for __p ≦__ 40.

Counting double covers of graphs

✍ M. Hofmeister 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

Any group of automorphisms of a graph G induces a notion of isomorphism between double covers of G. The corresponding isomorphism classes will be counted.

Counting labelled 3-connected graphs

✍ Nicholas Wormald 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 62 KB

Cubic graphs with most automorphisms

✍ Rev. Michael A. van Opstall; Răzvan Veliche 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 262 KB

## Abstract We give a sharp bound for the order of the automorphism group of a connected simple cubic graph on a given number of vertices. For each number of vertices we construct a graph, unique in special cases, attaining the bound. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 99–115, 2010

Path factors in cubic graphs

✍ Ken-ichi Kawarabayashi; Haruhide Matsuda; Yoshiaki Oda; Katsuhiro Ota 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB

Det-extremal cubic bipartite graphs

✍ M. Funk; Bill Jackson; D. Labbate; J. Sheehan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

## Abstract Let __G__ be a connected __k__–regular bipartite graph with bipartition __V__(__G__) = __X__ ∪ __Y__ and adjacency matrix __A__. We say __G__ is det‐extremal if __per__ (__A__) = |__det__(A)|. Det–extremal __k__–regular bipartite graphs exist only for __k__ = 2 or 3. McCuaig has charac