On (k) -coloring of generalized Petersen graphs
bad edges; Improper coloring; k-coloring; near proper coloring
The chromatic number, ?(G) of a graph G is the minimum number of colors used in a proper coloring of G. In an improper coloring, an edge uv is bad if the colors assigned to the end vertices of the edge is the same. Now, if the available colors are less than that of the chromatic number of graph G, then coloring the graph with the available colors leads to bad edges in G. In this paper, we use the concept of (k)-coloring and determine the number of bad edges in generalized Petersen graph (P(n,t)). The number of bad edges which result from a (k)-coloring of G is denoted by bk(G). 2022 World Scientific Publishing Company.
Discrete Mathematics, Algorithms and Applications, Vol-14, No. 1
https://doi.org/10.1142/S1793830921500968 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85101773415&doi=10.1142%2fS1793830921500968&partnerID=40&md5=ad9d0f2ead9fa0731eb4dd385b02cfd6
Ellumkalayil M.T., Department of Mathematics, CHRIST (Deemed to Be University), Bangalore, 560029, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to Be University), Bangalore, 560029, India