Some Combinatorial Problems on Halin Graphs

M. Kavin, K. Keerthana, N. Sadagopan +2

Let $T$ be a tree with no degree 2 vertices and $L(T)=\{l_1,\dots ,l_r\},r\ge 2$ denote the set of leaves in $T$. An Halin graph $G$ is a graph obtained from $T$ such that $V(G)…