𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dominating cycles in halin graphs

✍ Scribed by Mirosława Skowrońska; Maciej M. Sysło

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
676 KB
Volume
86
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 can give formulae for finding a shortest D-cycle. Then, dominating cycles and D-cycles in a Halin graph H are characterized in terms of the cycle graph, the intersection graph of the faces of H.

📜 SIMILAR VOLUMES

Lengths of cycles in halin graphs
Lengths of cycles in halin graphs
✍ J. A. Bondy; L. Lovász 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB 👁 1 views

A Halin graph is a plane graph H = T U C, where T is a plane tree with no vertex of degree t w o and at least one vertex of degree three or more, and C is a cycle connecting the endvertices of T in the cyclic order determined by the embedding of T We prove that such a graph on n vertices contains cy

Minimum cycle bases of Halin graphs
Minimum cycle bases of Halin graphs
✍ Peter F. Stadler 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract Halin graphs are planar 3‐connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not “necklaces” have a unique minimum cycle basis. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 150–155, 2003

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

Dominating cycles in regular 3-connected
Dominating cycles in regular 3-connected graphs
✍ Bill Jackson; Hao Li; Yongjin Zhu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Jackson, B., H. Li and Y. Zhu, Dominating cycles in regular 3-connected graphs, Discrete Mathematics 102 (1992) 163-176. Let G be a 3-connected, k-regular graph on at most 4k vertices. We show that, for k > 63, every longest cycle of G is a dominating cycle. We conjecture that G is in fact hamilton

On the length of longest dominating cycl
On the length of longest dominating cycles in graphs
✍ Hoa Vu Dinh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 719 KB

Vu Dinh, H., On the length of longest dominating cycles in graphs, Discrete Mathematics 121 (1993) 21 l-222. ## A cycle C in an undirected and simple graph if G contains a dominating cycle. There exists l-tough graph in which no longest cycle is dominating. Moreover, the difference of the length