𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some properties onf-edge covered critical graphs

✍ Scribed by Jihui Wang; Jianfeng Hou; Guizhen Liu

Book ID
105626333
Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
214 KB
Volume
24
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some 3-connected 4-edge-critical non-Ham
Some 3-connected 4-edge-critical non-Hamiltonian graphs
✍ Yang Yuansheng; Zhao Chengye; Lin Xiaohui; Jiang Yongsong; Hao Xin πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 79 KB πŸ‘ 1 views

## Abstract Let Ξ³(__G__) be the domination number of graph __G__, thus a graph __G__ is __k__‐edge‐critical if Ξ³ (__G__) = k, and for every nonadjacent pair of vertices __u__ and Ο…, Ξ³(__G__ + __u__Ο…) = kβˆ’1. In Chapter 16 of the book β€œDomination in Graphsβ€”Advanced Topics,” D. Sumner cites a conjectu