✦ LIBER ✦

Forwarding indices of k-connected graphs

✍ Scribed by M.C Heydemann; J.C Meyer; J Opatrny; D Sotteau

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 935 KB
Volume: 37-38
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90140-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Edge-forwarding Indices of Froben

On the Edge-forwarding Indices of Frobenius Graphs

✍ Yan Wang; Xin Gui Fang; D. F. Hsu 📂 Article 📅 2006 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 183 KB

Critically (k, k)-connected graphs

✍ Kiyoshi Ando; Yoko Usami 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 359 KB

k-shredders in k-connected graphs

✍ Yoshimi Egawa 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract For a graph __G__, a subset __S__ of __V__(__G__) is called a shredder if __G__ − __S__ consists of three or more components. We show that if __k__ ≥ 4 and __G__ is a __k__‐connected graph, then the number of shredders of cardinality __k__ of __G__ is less than 2|__V__(__G__)|/3 (we sho

Minimally (k, k)-edge-connected graphs

✍ Kamal Hennayake; Hong-Jian Lai; Deying Li; Jingzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract For an integer __l__ > 1, the __l__‐edge‐connectivity of a connected graph with at least __l__ vertices is the smallest number of edges whose removal results in a graph with __l__ components. A connected graph __G__ is (__k__, __l__)‐edge‐connected if the __l__‐edge‐connectivity of __G_

Connected [k, k + 1]-factors of graphs

✍ Mao-cheng Cai 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Let k be an odd integer /> 3, and G be a connected graph of odd order n with n/>4k -3, and minimum degree at least k. In this paper it is proved that if for each pair of nonadjacent vertices u, v in G max{dG(u), d~(v)} >~n/2, then G has an almost k--factor F + and a matching M such that F-and M are

Minimal k-arc connected graphs

✍ D. R. Fulkerson; L. S. Shapley 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB