On fractional chromatic number of special families of Halin graphs

In a graph’s fractional chromatic number, the infimum for a/b rational integers like a correct G’s a/b-coloring exists is χf(G). The need that χf(G) be a rational integer for a random graph is not immediately apparent from this statement. When all of the leaves on a cubic Halin graph are located at an equal distance by the root vertex, the graph is said to be completely cubic. In this study, we calculate the Halin graph’s fractional chromatic number.