𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Erratum to “Eigenvalues and edge-connectivity of regular graphs”

✍ Scribed by Sebastian M. Cioab

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
48 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bound of cyclic edge connectivity
Lower bound of cyclic edge connectivity for n-extendability of regular graphs
✍ Dingjun Lou; D.A. Holton 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 701 KB

A cyclically m-edge-connected n-connected k-regular graph is called an (m.n.k) graph. It is proved that for any m > 0 and k 2 3, there is an (m, k, k) bipartite graph. A graph G is n-extendable if every matching of size n in G lies in a perfect matching of G. We prove the existence of a (k2-1, k + 1

Super edge connectivity properties of co
Super edge connectivity properties of connected edge symmetric graphs
✍ Li, Qiaoliang; Li, Qiao 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Յ i Յ 2d Ϫ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s

Almost regular edge colorings and regula
Almost regular edge colorings and regular decompositions of complete graphs
✍ Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract For __k__ = 1 and __k__ = 2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edge‐disjoint __k__‐regular subgraphs of specified orders __m__~1~,__m__~2~,… ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge