✦ LIBER ✦

Crossing properties of graph reliability functions

✍ Scribed by Alexander K. Kelmans

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 237 KB
Volume: 35
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200011)35:3<206::aid-jgt6>3.0.co;2-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reliability analysis of circulant graphs

✍ Li, Qiaoliang; Li, Qiao 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

The circulant graphs are of particular interest as models of communication networks. In this work, we present new reliability analysis results for circulants based on the concept of restricted edge connectivity, which generalizes the super-l property of a graph. We evaluate the restricted edge conne

Reliability analysis of replicated and-o

Reliability analysis of replicated and-or graphs

✍ Liang, De-Ron; Jan, Rong-Hong; Tripathi, Satish K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 2 views

A computation task running in distributed systems can be represented as a directed graph H(V, E) whose vertices and edges may fail with known probabilities. In this paper, we introduce a reliability measure, called the distributed task reliability, to model the reliability of such computation tasks.

Crossing numbers of graph embedding pair

Crossing numbers of graph embedding pairs on closed surfaces

✍ Seiya Negami 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 262 KB 👁 2 views

Crossing properties of multiterminal cut

Crossing properties of multiterminal cuts

✍ Easley, Robert F.; Hartvigsen, David 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB 👁 1 views

Gomory and Hu proved the following classical result: For any graph with nonnegative edge weights, there exists a collection of noncrossing cuts that contains a minimum cut for every pair of nodes. In this paper, we show how this result generalizes for a natural multiterminal cut problem. We also sho

Syntheses and properties of cross-linked

Syntheses and properties of cross-linked polymers from functionalized triglycerides

✍ Hui-Ping Zhao; Jian-Feng Zhang; Xiuzhi Susan Sun; Duy H. Hua 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 371 KB

## Abstract A number of functionalized triglycerides were synthesized from glyceryl trioleoate via epoxidation followed by reduction to give glyceryl tris(9‐hydroxy)trioleoate (a triol) or hydrolytic ring opening to obtain glyceryl tris(9,10‐dihydroxy)trioleoate (a hexaol). A selective monoepoxidat

Properties of edge-deleted distance stab

Properties of edge-deleted distance stable graphs

✍ Klemm, Karen; Winters, Steven J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

The distance from a vertex u to a vertex v in a connected graph G is the length of a shortest u-v path in G. The distance of a vertex v of G is the sum of the distances from v to the vertices of G. For a vertex v in a 2-edge-connected graph G, we define the edge-deleted distance of v as the maximum