𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the computation of the k-closure of a graph

✍ Scribed by Jayme Luiz Szwarcfiter

Book ID
113163073
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
139 KB
Volume
24
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on computing graph closures
A note on computing graph closures
✍ Jeremy P. Spinrad πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 153 KB

This note shows that the k-closure of a graph can be computed in time proportional to the size of the output, improving on previous O(n 3 ) algorithms.

A note on the k-degree Cayley graph
A note on the k-degree Cayley graph
✍ Yuuki Tanaka; Yukio Shibata πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 69 KB
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__