Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1710110 | Applied Mathematics Letters | 2009 | 5 Pages |
Abstract
A complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
W.C. Shiu, W.K. Tam,