There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; Brandstädt et al. 1987, p. 112) consisting of a central complete graph K_n with an outer ring of n vertices, each of which is joined to both endpoints of the closest outer edge of the central core. Wallis and Anitha and Lekshmi use the term "n-sun" graph to instead refer to the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n. These graphs are referred to as "sunlet graphs" by ISGCI. The 3-sunlet graph C_3 ⊙K_1 is also known as the net graph. The sun graphs are pancyclic and uniquely Hamiltonian.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.