𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum dominating cycles in 2-trees

✍ Scribed by Andrzej Proskurowski

Publisher
Springer
Year
1979
Tongue
English
Weight
610 KB
Volume
8
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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}.