𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal K-secure graphs

✍ Scribed by G. Gunther; B.L. Hartnell


Book ID
104182610
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
820 KB
Volume
2
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Security in graphs
✍ Robert C. Brigham; Ronald D. Dutton; Stephen T. Hedetniemi πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 153 KB
Perfect k-line graphs and k-total graphs
✍ Van Bang LΓͺ πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 443 KB πŸ‘ 1 views

## Abstract The concept of the line graph can be generalized as follows. The __k__‐line graph __L__~__k__~(__G__) of a graph __G__ is defined as a graph whose vertices are the complete subgraphs on __k__ vertices in __G.__ Two distinct such complete subgraphs are adjacent in __L__~__k__~(__G__) if