𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recursive families of graphs

✍ Scribed by N.L Biggs; R.M Damerell; D.A Sands

Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
422 KB
Volume
12
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Recursive generation of partitionable gr
Recursive generation of partitionable graphs
✍ E. Boros; V. Gurvich; S. Hougardy πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 201 KB

## Abstract Results of LovΓ‘sz (1972) and Padberg (1974) imply that partitionable graphs contain all the potential counterexamples to Berge's famous Strong Perfect Graph Conjecture. A recursive method of generating partitionable graphs was suggested by ChvΓ‘tal, Graham, Perold, and Whitesides (1979).

Pancyclicity of recursive circulant grap
Pancyclicity of recursive circulant graphs
✍ Toru Araki; Yukio Shibata πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 96 KB

In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic.

Infinite families of -integral graphs
Infinite families of -integral graphs
✍ Maria Aguieiras A. de Freitas; Nair M.M. de Abreu; Renata R. Del-Vecchio; Samuel πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 152 KB

In this article, we characterize all signless Laplacian integral graphs (here called Q -integral graphs) in the following classes: complete split graphs, multiple complete split-like graphs, extended complete split-like graphs, multiple extended split-like graphs. All these graphs were defined by Ha