L(2, 1) Colouring and Radio Colouring of Some Graphs and its Parametrized Graphs

Graph Theory would not be what it is today without graph colouring. Graph colouring is the major part of discrete mathematics which is majorly used in network analysis. Radio colouring and L(2,1) colouring are cardinal topics in graph theory that associate many real life situation.The dominant role of graph colouring is to partition the independent components which in turn is applied in practical solution of networks. The interference reduction problem is modeled as a graph coloring problem which is the principal keynote of study. There are several wellknown colouring parameters in graph theory. Here we deal with the following colouring parameters, radio number and span.The colouring parameters correlates the constrains of networks. In this article the span of sunlet, bistar, pencil graph families and radio number of Mycielski of cycle, bistar graphs are examined. Also, the comparison of span and radio number of some graph families are examined.