✦ LIBER ✦

Strength and reinforcement of a network and tree packing

✍ Scribed by V. A. Trubin

Publisher: Springer US
Year: 1991
Tongue: English
Weight: 895 KB
Volume: 27
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068376

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strength of a graph and packing of trees

Strength of a graph and packing of trees and branchings

✍ V. A. Trubin 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 525 KB

The distribution and strength of riparia

The distribution and strength of riparian tree roots in relation to riverbank reinforcement

✍ Bruce Abernethy; Ian D. Rutherfurd 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB 👁 1 views

## Abstract The main influences of plants on the mass stability of riverbanks are those that affect the strength of bank sediments. Plants enhance bank strength by reducing pore‐water pressures and by directly reinforcing bank material with their roots. In this paper we do not consider bank hydrolo

Integral packing of trees and branchings

✍ V. A. Trubin 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 278 KB

Edge-packing of graphs and network relia

Edge-packing of graphs and network reliability

✍ Charles J. Colbourn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 842 KB

The reliability of a network can be efficiently bounded using graph-theoretical techniques based on edge-packing. We examine the application of combinatorial theorems on edgepacking spanning trees, s, t-paths, and s, t-cuts to the determination of reliability bounds. The application of spanning tree

Packing and Decomposition of Graphs with

Packing and Decomposition of Graphs with Trees

✍ Raphael Yuster 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Let H be a tree on h 2 vertices. It is shown that if n is sufficiently large and G=(V, E ) is an n-vertex graph with $(G) wnÂ2x , then there are w |E |Â(h&1)x edge-disjoint subgraphs of G which are isomorphic to H. In particular, if h&1 divides |E | then there is an H-decomposition of G. This result

Packing a tree with a graph of the same

Packing a tree with a graph of the same size

✍ P. J. Slater; S. K. Teo; H. P. Yap 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract We prove that if __T__ is a tree of order __p__ ⩾ 5 and __G__ is a graph of order __p__ and size __p__ ‐ 1 such that neither __T__ nor __G__ is a star, then __T__ can be embedded in G, the complement of __G__.