The binding number of Halin graphs (Q1123910)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4110747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The binding number of Halin graphs |
scientific article; zbMATH DE number 4110747 |
Statements
The binding number of Halin graphs (English)
0 references
1988
0 references
This paper deals with the concept ``binding number bind(G)'' of a graph \(G=(V,E)\) introduced by Woodall. The author shows that for every Halin graph H with n vertices the binding number bind(H) equals to (n-1)\(| (n-3)\) or to \((n+1)| (n-1)\). He finishes by giving a linear-time algorithm to find the binding number of a Halin graph of odd order different from a wheel.
0 references
binding number
0 references
Halin graph
0 references
0.8344305157661438
0 references
