Browsing by Author "Venkatachalam, M."

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    On equitable chromatic number of Tadpole graph T_{m,n}
    (Ankara Üniversitesi Fen Fakültesi, 2019-08-01) Venkatachalam, M.; Praveena, K.; Other; Other
    Graph coloring is a special case of graph labeling. Proper vertex k-coloring of a graph Gis to color all the vertices of a graph with different colors in such a way that no two adjacent vertices are assigned with the same color. In a vertex coloring of G, the set of vertices with the same color is called color class. An equitable k-coloring of a graph G is a proper k-coloring in which any two color classes differ in size by atmost one. In this paper we give results regarding the equitable coloring of central, middle, total and line graphs of Tadpole graph which is obtained by connecting a cycle graph and a path graph with a bridge.
  • No Thumbnail Available
    Item
    On irregular coloring of wheel related graphs
    (Ankara Üniversitesi Fen Fakültesi, 2019-08-01) Rohini, A.; Venkatachalam, M.; Other; Other
    An irregular coloring is a proper coloring in which distinct vertices have different color codes. In this paper, we obtain the irregular chromatic number for middle graph, total graph, central graph and line graph of wheel graph, helm graph, gear graph and closed helm graph.
  • No Thumbnail Available
    Item
    On irregular colorings of double wheel graph families
    (Ankara Üniversitesi Fen Fakültesi, 2019-02-01) Rohini, A.; Venkatachalam, M.; Other; Other
    An assignment of colors to the vertices of a graph, so that no two adjacent vertices get the same color is called a proper coloring. An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the graph either by their own colors or by the colors of their neighbours. In this paper, we investigate the irregular chromatic number for the middle graph, total graph, central graph and line graph of double wheel graph.