✦ LIBER ✦

Cyclical Edge-Connectivity of Fullerene Graphs and (k, 6)-Cages

✍ Scribed by Tomislav Došlić

Book ID: 110433870
Publisher: Springer
Year: 2003
Tongue: English
Weight: 154 KB
Volume: 33
Category: Article
ISSN: 0259-9791
DOI: 10.1023/a:1023299815308

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the cyclical edge-connectivity

A note on the cyclical edge-connectivity of fullerene graphs

✍ Zhongbin Qi; Heping Zhang 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 143 KB

The connectivity of the SEE-graph and AE

The connectivity of the SEE-graph and AEE-graph for the connected spanning k-edge subgraphs of a graph

✍ Xueliang Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 447 KB

The existence of a 2-factor in K1, n-fre

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity

✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.

Ends and Vertices of Small Degree in Inf

Ends and Vertices of Small Degree in Infinite Minimally k -(Edge)-Connected Graphs

✍ Stein, Maya 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 321 KB

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will