𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-dominating cycles in graphs

✍ Scribed by Shinya Fujita; Akira Saito; Tomoki Yamashita

Book ID
108113780
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
181 KB
Volume
307
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Edge degrees and dominating cycles
Edge degrees and dominating cycles
✍ Kiyoshi Yoshimoto πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 200 KB
Dominating cycles in bipartite biclaw-fr
Dominating cycles in bipartite biclaw-free graphs
✍ Daniel Barraez; Evelyne Flandrin; Hao Li; Oscar Ordaz πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 354 KB

Flandrin et ai. (to appear) define a simple bipartite graph to be biclaw-free if it contains no induced subgraph isomorphic to H, where H could be obtained from two copies of K1.3 by adding an edge joining the two vertices of degree 3. They have shown that if G is a bipartite, balanced, biclaw-free