Communication systems including AM and FM radio stations transmitting signals are capable of generating interference due to unwanted radio frequency signals. To avoid such interferences and maximize the number of channels for a predefined spectrum bandwidth, the radio-k-chromatic number problem is introduced. LetG=V,Ebe a connected graph with diameterdand radiusρ. For any integerk,1≤k≤d, radiok−coloring of G is an assignmentφof color (positive integer) to the vertices ofGsuch thatda,b+φa−φb≥1+k,∀a,b∈VG,whereda,bis the distance betweenaandbin G. The biggest natural number in the range ofφis called the radiok−chromatic number of G, and it is symbolized byrckφ. The minimum number is taken over all such radiok−chromatic numbers ofφwhich is called the radiok−chromatic number, denoted byrckG. Fork=dandk=ρ, the radiok−chromatic numbers are termed as the radio number (rnG) and radial radio number (rrG) ofG, respectively. In this research work, the relationship between the radio number and radial radio number is studied for any connected graph. Then, several sunflower extended graphs are defined, and the upper bounds of the radio number and radial radio number are investigated for these graphs.