Total views : 197

Upper Bound for the Radio Number of Some Families of Sunlet Graph


  • Department of Mathematics, Faculty of Science and Humanities, SRM University, Kattankulathur-603 203 Tamil Nadu, India


Objectives: In this study, Radio Coloring is used to color the graphs. The objective of this article is to analyze the bounds of Line, Middle, Total and Central graphs of Sunlet graph. Methods/Analysis: Combinatorics is an important part of discrete mathematics that solves counting problems without actually enumerating all possible cases. Combinatorics has wide applications in Computer Science, especially in coding theory, analysis of algorithms and others. An equation that expresses an, the general term of the sequence {an} is called a recurrence relation. Using the generating function of a sequence and few coloring techniques we prove the results. Findings: The Problem of finding radio coloring with small or optimal k arises in the concept of radio frequency assignment. The radio chromatic score rs(G)17 of a radio coloring is the number of used colors. The number of colors used in a radio coloring with the minimum score is the radio chromatic rn(G) of G. The radio chromatic number of Sunlet graph Sn is 10 4 if n=3i, i=1,2,... 5 if n=3i+1, i=1,2,... 6 if n=3i+2, i=1,2,... and is improved to the radio chromatic number of Sunlet graph Sn is 5 if n is congruent to 1mod 3 4 if otherwise In this paper we improve the radio chromatic number of Sunlet graph Sn and obtain the radio number of Line, Middle, Total and Central graphs of Sunlet graph. Radio Coloring has wide range of significance because radio coloring has its applications in communication theory. The paper contributes the researches in the field of computer science and combinatorics. Applications: Radio coloring is of great significance because the frequency assignment problem is modeled as a graph coloring problem assuming transmitters as vertices and interference as adjacencies between two vertices.


Sunlet Graph, Line Graph, Middle Graph, Radio Number, Total Graph and Central Graph.

Full Text:

 |  (PDF views: 211)


  • Griggs, Yeh RK. Labeling graphs with a condition at distance 2, SIAM Journal of Discrete Mathematics. 5.1992.p.586–95.
  • Chang GJ, Kuo D. The L(2,1)-Labeling problem on graphs, SIAM J. Disc .Math. 9 1996. p.309–16.
  • Jonas K. Graph Colorings analogues with a condition at distance two; L(2,1)-labelings and list λ -labelings, Ph.D.thesis, University of South Carolina.1993.
  • Bertossi AA, Pinotti C, Tan R.B. L(2,1,1)-Labeling problem on graphs, In preparation (1999).
  • Sakai D. Labeling chordal graphs: distance two condition, SIAM J.Disc.Math. 7(1194) .p. 133–140.
  • Georges JP, Mauro DW. On the size of graphs labeled with a condition at distance two. Journal of Graph Theory 22 1996.p. 47–57.
  • Georges JP, Mauro DW, Whittlesey MA. Relating path coverings to vertex labeling with a condition at distance two, Discrete Mathematics 135. 1994. p.103–11.
  • Yeh RK, Labelling graphs with a condition at distance two.Ph.D Thesis, University of South Cardino(1990).
  • Fiala J, Kloks T, Kratochvil J. Fixed-parameter complexity of λ -labelings, In: Graph-Theoretic Concept of Computer Science, Proceedings 25th WG’99, Lecture Notes in Computer Science Vol.1665, Springer Verlag (1999). p.350–63.
  • Vimala Rani A , Parvathi N. Radio number of Star graph and Sunlet graph, Global Journal of Pure and Applied Mathematics (GJPAM) ISSN 0973-1768 . 2016; 12( 1):151–56.
  • Bondy JA , Murty USR. Graph Theory with Applications.
  • Chang J, David Kuo, SIAM J. Discrete Math., The L(2,1)Labeling Problem on Graphs, Gerard 9(2), 309–316.
  • Vernold Vivin J, Vekatachalam M. On b-chromatic number of Sun let graph and wheel graph families, Journal of the Egyptian Mathematical Society 2015; 23, p. 215–18.
  • Thilagavathi K, Shanas Babu P. A Note on Acyclic Coloring of Central Graphs. International Journal of Computer Applications. 0975-8887. 2010; September, 7(2).
  • Ramachandran M, Parvathi N. The Medium Domination Number of Jahangir Graph Jm,n, Indian Journal of Science and Technology. 2015; March, 8(5): 400–6.
  • Pounambal M. Survey on Channel Allocation Techniques for Wireless Mesh Network to Reduce Contention with Energy Requirement, Indian Journal of Science and Technology. 2016; August, 9(32).
  • Kalfakakou R, Nikolakopoulou G, Savvidou E, Tsouros M. Graph Radiocoloring Concepts , Aristotle University of Thessaloniki, Faculty of Engineering Thessaloniki, Greece.


  • »
  • »
  • »
  • »

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.