Abstract
Let $G=(V,E)$ be a finite graph. The Generalized Fan Graph $F_{m,n}$ is defined as the graph join $\overline{K_m}+P_n$, where $\overline{K_m}$ is the empty graph on $m$ vertices and $P_n$ is the path graph on $n$ vertices. Decomposition of Generalized Fan Graph denoted by $D(F_{m,n})$. A star with $3$ edges is called a claw $S_3$. In this paper, we discuss the decomposition of Generalized Fan Graph into claws, cycles and paths.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
