We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
On δ(k)-coloring of generalized Petersen graphs.
- Authors
Ellumkalayil, Merlin Thomas; Naduvath, Sudev
- Abstract
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 u v 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 b k (G).
- Subjects
PETERSEN graphs; GRAPH coloring; COLORING matter
- Publication
Discrete Mathematics, Algorithms & Applications, 2022, Vol 14, Issue 1, p1
- ISSN
1793-8309
- Publication type
Article
- DOI
10.1142/S1793830921500968