𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degree sums, connectivity and dominating cycles in graphs

✍ Scribed by Sun Zhiren; Tian Feng; Wei Bing

Book ID
105641890
Publisher
Springer
Year
1998
Tongue
English
Weight
63 KB
Volume
43
Category
Article
ISSN
1001-6538

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Long cycles in graphs with large degree
Long cycles in graphs with large degree sums
✍ Douglas Bauer; H.J. Veldman; A. Morgana; E.F. Schmeichel πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 764 KB
A degree sum condition for longest cycle
A degree sum condition for longest cycles in 3-connected graphs
✍ Tomoki Yamashita πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 110 KB πŸ‘ 1 views

## Abstract For a graph __G__, we denote by __d__~__G__~(__x__) and ΞΊ(__G__) the degree of a vertex __x__ in __G__ and the connectivity of __G__, respectively. In this article, we show that if __G__ is a 3‐connected graph of order __n__ such that __d__~__G__~(__x__) + __d__~__G__~(__y__) + __d__~__

Long dominating cycles in graphs
Long dominating cycles in graphs
✍ Ruqun Shen; Feng Tian πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 310 KB

Let G be a connected graph of order n, and let NC2(G) denote min{ [N(u) UN(v)[: In this paper, we prove that if G contains a dominating cycle and ~ ~> 2, then G contains a dominating cycle of length at least min{n,2NC2(G)-3}.

Dominating cycles in halin graphs
Dominating cycles in halin graphs
✍ MirosΕ‚awa SkowroΕ„ska; Maciej M. SysΕ‚o πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 676 KB

A cycle in a graph is dominating if every vertex lies at distance at most one from the cycle and a cycle is D-cycle if every edge is incident with a vertex of the cycle. In this paper, first we provide recursive formulae for finding a shortest dominating cycle in a Hahn graph; minor modifications ca