Modular Coloring and Switching in Some Planar Graphs

G. R Sanma, P Maya

Abstract


For a connected graph G, let c: V (G) →ℤk (k ≥ 2) be a vertex coloring of G. The color sum \sigma(v) of a vertex v of G is defined as the sum in ℤk of the colors of the vertices in N (v) that is (v) = \sum_{u\inN(v)}{c(u)} (mod k). The coloring c is called a modular k-coloring of G if ????(x) ≠ ????(y) in ℤk for all pairs of adjacent vertices x, y \in\ G. The modular chromatic number or simply the mc-number of G is the minimum k for which G has a modular k-coloring. A switching graph is an ordinary graph with switches. For many problems, switching graphs are a remarkable straight forward and natural model, but they have hardly been studied. A vertex switching Gv of a graph G is obtained by taking a vertex V of G, removing the entire edges incident with V and adding edges joining V to every vertex which are not adjacent to V in G. In this paper we determine the modular chromatic number of Wheel graph, Friendship graph and Gear graph after switching on certain vertices. Here, we first define switching of graphs. Next, we investigating several problems on finding the mc(G) after switching of graphs and provide their characterization in terms of complexity.

Keywords


Wheel Graph, Friendship graph, gear graph

Full Text:

PDF

References


G. Chartrand and P. Zhang. Chromatic graph theory Chapman and Hall/CRC Press, Boca Raton (2009)

T. Nicholas, Sanma. G. R. Modular colorings of circular Halin graphs of level two, Asian journal of Mathematics and Computer Research 17(1): 48-55, 2017

N. Paramaguru, R. Sampathkumar. Modular colorings of join of two special graphs. Electronic journal of graph theory and applications 2(2) (2014), 139- 149.

F. Okamoto, E. Salehi, P. Zhang. A checkerboard problem and modular colorings of graph Bull. Inst. combin. Appl 58(2010), 29 - 47.

F. Okamoto, E. Salehi, P. Zhang. A solution to checkerboard problem J. Comput. Appl. Math- 5(2010) 447 - 458

F. Okamoto, E. Salehi, P. Zhang. On modular colorings of graphs Pre-print.

Patrick Neisink. The Vertex switching reconstruction problem. University of Ottawa, Canada




DOI: http://dx.doi.org/10.23755/rm.v45i0.984

Refbacks

  • There are currently no refbacks.


Copyright (c) 2023 Sanma G. R, Maya P

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.