𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum graphs with complete k-closure

✍ Scribed by L. Clark; R.C. Entringer; D.E. Jackson

Book ID
107748334
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
662 KB
Volume
30
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimum k-broadcast graphs
Minimum k-broadcast graphs
✍ J.-C. KΓΆnig; E. Lazard πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 647 KB
Minimum K-hamiltonian graphs
Minimum K-hamiltonian graphs
✍ W. W. Wong; C. K. Wong πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 401 KB
Minimum k-hamiltonian graphs, II
Minimum k-hamiltonian graphs, II
✍ M. Paoli; W. W. Wong; C. K. Wong πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 523 KB

We consider in this paper graphs which remain hamiltonian after the removal of k edges (k-edge hamiltonian) or k vertices (k-hamiltonian). These classes of graphs arise from reliability considerations in network design. In a previous paper, W. W. Wong and C. K. Wong presented families of minimum k-h

The complete closure of a graph
The complete closure of a graph
✍ Ralph Faudree; Odile Favaron; Evelyne Flandrin; Hao Li πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 677 KB

## Abstract We define the complete closure number cc(__G__) of a graph __G__ of order __n__ as the greatest integer __k__ ≀ __2n__ βˆ’ __3__ such that the __k__th Bondy‐ChvΓ‘tal closure Cl~__k__~(__G__) is complete, and give some necessary or sufficient conditions for a graph to have cc(__G__) = __k__