Chromatic Uniqueness and Equivalence of Generalized Fan Graphs
This paper studies the chromatic uniqueness of the generalized fan graph \mathbit{F}_{\mathbit{n},\mathbit{m}}=\mathbit{O}_\mathbit{n}+ \mathbit{P}_\mathbit{m}, where \mathbit{n}\geq\mathbf{1} and \mathbit{m}\geq\mathbf{2}. The objective is to determine the conditions under which \mathbit{F}_{\mathbit{n},\mathbit{m}}\ is chromatically unique and to classify its equivalence classes. By analyzing the chromatic polynomial, we show that uniqueness is restricted to the small cases: \mathbit{F}_{\mathbit{n},\mathbit{m}},\;\hairsp\mathbit{n}\le\mathbf{2},\;\hairsp\mathbit{m}\le\mathbf{3},\;\hairsp\mathbf{with}\ \mathbit{F}_{\mathbf{1},\mathbf{3}}\cong\mathbit{F}_{\mathbf{2},\mathbf{2}}. For all other parameters, \mathbit{F}_{\mathbit{n},\mathbit{m}}\ is not unique, and infinite families of chromatic equivalences are derived, including \mathbit{F}_{\mathbit{n},\mathbf{2}}\ \sim\mathbit{F}_{\mathbf{1},\mathbit{m}}\ and \mathbit{F}_{\mathbit{n},\mathbf{3}}\sim\mathbit{F}_{\mathbf{2},\mathbit{m}}, \mathbit{m}\geq\mathbit{n}+\mathbf{1}. This provides a complete characterization of the chromatic properties of generalized fan graphs and contributes to the broader theory of join graph invariants.