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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have