✦ LIBER ✦

A Construction Method for Minimally h-Edge-Connected Simple Graphs

✍ Scribed by BIWEN ZHU

Book ID: 119862818
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 362 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16452.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Construction Method for Critically K-E

A Construction Method for Critically K-Edge-Connected Graphs

✍ FUJI ZHANG; XIAOFENG GUO; RONGSI CHEN 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 406 KB

Removable edges in a 5-connected graph a

Removable edges in a 5-connected graph and a construction method of 5-connected graphs

✍ Liqiong Xu; Xiaofeng Guo 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 152 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

A simple method for construction ofpir+E

A simple method for construction ofpir+Enterobacterial hosts for maintenance of R6K replicon plasmids

✍ Brian H Kvitko, Steven Bruckbauer, John Prucha, Ian McMillan, Erin J Breland, St 📂 Article 📅 2012 🏛 BioMed Central 🌐 English ⚖ 366 KB