The binding number of Halin graphs
type: Item
instance of: scholarly article
title: The binding number of Halin graphs
zbMATH Open document ID: 0678.05055
DOI: 10.1016/0166-218X(88)90126-6
published in: Discrete Applied Mathematics
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 4110747
zbMATH Keywords: binding number
zbMATH Keywords: Halin graph
author: Miroslawa Skowronska
reviewed by: Rainer Bodendiek
MaRDI profile type: Publication
cites work: Q4087221
cites work: Q5622228
cites work: Parallel concepts in graph theory
cites work: Q3922728
cites work: The binding number of line graphs and total graphs
cites work: Q3710547
cites work: Q3335816
cites work: Q3322145
cites work: The binding number of a graph and its Anderson number
description: scientific article; zbMATH DE number 4110747