✦ LIBER ✦

Super -optimality of regular graphs

✍ Scribed by Litao Guo; Ruifang Liu; Xiaofeng Guo

Book ID: 113449225
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 227 KB
Volume: 25
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.07.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Super Restricted Edge Connectivity of Re

Super Restricted Edge Connectivity of Regular Graphs

✍ Ou Jianping; Fuji Zhang 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 244 KB

Super restricted edge connectivity of re

Super restricted edge connectivity of regular edge-transitive graphs

✍ Jin-Xin Zhou 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Super restricted edge connectivity of re

Super restricted edge connectivity of regular graphs with two orbits

✍ Huiqiu Lin; Jixiang Meng; Weihua Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Vertex fault tolerance of optimal-κ grap

Vertex fault tolerance of optimal-κ graphs and super-κ graphs

✍ Yanmei Hong; Zhao Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Regular packings of regular graphs

✍ A. Gutiérrez; A.S. Lladó 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Regular factors of regular graphs

✍ B. Bollobás; Akira Saito; N. C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a