✦ LIBER ✦

On the efficiency of regular generalized line graph designs

✍ Scribed by Ching-Shui Cheng; Gregory M. Constantine

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 712 KB
Volume: 15
Category: Article
ISSN: 0378-3758
DOI: 10.1016/0378-3758(86)90080-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regularity and the generalized adjacency

Regularity and the generalized adjacency spectra of graphs

✍ Andrey A. Chesnokov; Willem H. Haemers 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Generating all 4-regular planar graphs f

Generating all 4-regular planar graphs from the graph of the octahedron

✍ Jenö Lehel 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

## Abstract It has been communicated by P. Manca in this journal that all 4‐regular connected planar graphs can be generated from the graph of the octahedron using simple planar graph operations. We point out an error in the generating procedure and correct it by including an additional operation.

On the structure of regular pairwise bal

On the structure of regular pairwise balanced designs

✍ David McCarthy; S.A. Vanstone 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 664 KB

Note on the energy of regular graphs

✍ Xueliang Li; Yiyang Li; Yongtang Shi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Connectivity of random regular graphs ge

Connectivity of random regular graphs generated by the pegging algorithm

✍ Pu Gao 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract We study the connectivity of random __d__‐regular graphs which are recursively generated by an algorithm motivated by a peer‐to‐peer network. We show that these graphs are asymptotically almost surely __d__‐connected for any even constant __d__⩾4. © 2010 Wiley Periodicals, Inc. J Graph

The generalized acyclic edge chromatic n

The generalized acyclic edge chromatic number of random regular graphs

✍ Stefanie Gerke; Catherine Greenhill; Nicholas Wormald 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The __r__‐acyclic edge chromatic number of a graph is defined to be the minimum number of colors required to produce an edge coloring of the graph such that adjacent edges receive different colors and every cycle __C__ has at least min(|__C__|, __r__) colors. We show that (__r__ − 2)__d