𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The expected number of pairs of connected nodes: Pair-connected reliability

✍ Scribed by A.T Amin; K.T Siegrist; P.J Slater

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
926 KB
Volume
17
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Basis pair graphs of transversal matroid
Basis pair graphs of transversal matroids are connected
✍ Martin Farber πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 460 KB

The basis pair graph of a matroid on the ground set S has, as its vertices, ordered triples of the form (&, &, &), where B, and B2 are disjoint bases and B3 = S\(B, U 4). Two such vertices, (AI, AZ, As) and (Ri, B,, IQ, are adjacent if (B,, &, B3) can be obtained from (AI, A\*, As) by interchanging

Pancyclicity of 3-connected graphs: Pair
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
✍ Ronald J. Gould; Tomasz Łuczak; Florian Pfender πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 232 KB

## Abstract We characterize all pairs of connected graphs {__X__, __Y__} such that each 3‐connected {__X__, __Y__}‐free graph is pancyclic. In particular, we show that if each of the graphs in such a pair {__X__, __Y__} has at least four vertices, then one of them is the claw __K__~1,3~, while the