The binding number of Halin graphs
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3853133 (Why is no real title available?)
- scientific article; zbMATH DE number 3867372 (Why is no real title available?)
- scientific article; zbMATH DE number 3937204 (Why is no real title available?)
- scientific article; zbMATH DE number 3735875 (Why is no real title available?)
- scientific article; zbMATH DE number 3506739 (Why is no real title available?)
- scientific article; zbMATH DE number 3346402 (Why is no real title available?)
- Parallel concepts in graph theory
- The binding number of a graph and its Anderson number
- The binding number of line graphs and total graphs
Cited in
(6)- Extremal Halin graphs with respect to the signless Laplacian spectra
- scientific article; zbMATH DE number 15464 (Why is no real title available?)
- scientific article; zbMATH DE number 1548426 (Why is no real title available?)
- scientific article; zbMATH DE number 841606 (Why is no real title available?)
- scientific article; zbMATH DE number 4193733 (Why is no real title available?)
- On the edge-binding number of some plane graphs
This page was built for publication: The binding number of Halin graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123910)