✦ LIBER ✦

Transformations of cubic graphs

✍ Scribed by Yasuyuki Tsukui

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 401 KB
Volume: 333
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(96)00015-4

No coin nor oath required. For personal study only.

✦ Synopsis

For simple r-regular graph, an edge-reduction and three transformations (S-, X-, and ~-transformations) are defined which preserve the regularity. In the case r = 3, relations between them are discussed and it is proved that for any two connected cubic graphs with the same order one is obtained from the other by a finite sequence of S-transformations. Then it defines a metric on the set of connected cubic graphs.

📜 SIMILAR VOLUMES

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 cubic graphs

✍ Robert W. Robinson 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB

Fast generation of cubic graphs

✍ Brinkmann, Gunnar 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 620 KB

In this paper an efficient algorithm to generate regular graphs with small vertex valency is presented. The running times of a program based on this algorithm and designed to generate cubic graphs are below two natural benchmarks: (a) If N ( n ) denotes the number of pairwise non-isomorphic cubic gr

Change graphs of edge-colorings of plana

Change graphs of edge-colorings of planar cubic graphs

✍ Anton Kotzig 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Graphs of Acyclic Cubical Complexes

✍ Hans-Jürgen Bandelt; Victor Chepoi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Graphs of nonsingular threshold transfor

Graphs of nonsingular threshold transformations

✍ Takao Ueda 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 695 KB

After the graph structures of self-dual nonsingular (i.e. one-to-one) transformations of (0, 1)" are described, a construction method of generating minimal nonsingular threshold transformations from lower-dimensional ones is presented. Theorems which concern nonsingular threshold transformations and