𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vulnerability in graphs of diameter five

✍ Scribed by Cheng-De Xu

Book ID
107482074
Publisher
Chinese Electronic Periodical Services
Year
2003
Tongue
English
Weight
338 KB
Volume
7
Category
Article
ISSN
1007-6417

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Diameter vulnerability of graphs
Diameter vulnerability of graphs
✍ C. Peyrat πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 344 KB
Vulnerability in graphs of diameter four
Vulnerability in graphs of diameter four
✍ Geoffrey Exoo; Frank Harary; Cheng-De Xu πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 285 KB

The analogue of Menger's Theorem on connectivity has been investigated for graphs of low diameter in which the removal of a set of lines increases the diameter. When the diameter is at most three, such a theorem has been proven already. Also, examples have been constructed to show that the result do

Diameter vulnerability of GC graphs
Diameter vulnerability of GC graphs
✍ J. GΓ³mez; I. Pelayo; C. Balbuena πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 469 KB

Concern over fault tolerance in the design of interconnection networks has stimulated interest in ΓΏnding large graphs with maximum degree and diameter D such that the subgraphs obtained by deleting any set of s vertices have diameter at most D , this value being close to D or even equal to it. This

Antipodal distance-regular graphs of dia
Antipodal distance-regular graphs of diameter four and five
✍ Tilla Schade πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 179 KB πŸ‘ 2 views

An antipodal distance-regular graph of diameter four or five is a covering graph of a connected strongly regular graph. We give existence conditions for these graphs and show for some types of strongly regular graphs that no nontrivial covers exist.