𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Binding Number, Minimum Degree, and Cycle Structure in Graphs

✍ Scribed by D. Bauer; E. Schmeichel

Book ID
112121103
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
504 KB
Volume
71
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of cycle lengths in graphs of
The number of cycle lengths in graphs of given minimum degree and girth
✍ P. ErdΕ‘s; R.J. Faudree; C.C. Rousseau; R.H. Schelp πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 333 KB

This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g. The most general result gives a lower bound of ck ~.

Cycle lengths in graphs with large minim
Cycle lengths in graphs with large minimum degree
✍ V. Nikiforov; R. H. Schelp πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 114 KB πŸ‘ 1 views

## Abstract Our main result is the following theorem. Let __k__ β‰₯ 2 be an integer, __G__ be a graph of sufficiently large order __n__, and __Ξ΄__(__G__) β‰₯ __n__/__k__. Then: __G__ contains a cycle of length __t__ for every even integer __t__β€‰βˆˆβ€‰[4, __Ξ΄__(__G__) + 1]. If __G__ is nonbipartite then

Domination number in graphs with minimum
Domination number in graphs with minimum degree two
✍ Er Fang Shan; Moo Young Sohn; Xu Dong Yuan; Michael A. Henning πŸ“‚ Article πŸ“… 2009 πŸ› Institute of Mathematics, Chinese Academy of Scien 🌐 English βš– 264 KB