• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.149-156
• /
• 2006

The circular list coloring is a circular version of list colorings of graphs. Let $\chi_{c,l}$ denote the circular choosability(or the circular list chromatic number). In this paper, the circular choosability of outer planar graphs and odd wheel is discussed.

• Journal of Applied and Pure Mathematics
• /
• v.6 no.1_2
• /
• pp.55-69
• /
• 2024

Let a graph G = (V, E) be a (p, q) graph. Define $${\rho}=\{\array{{\frac{p}{2}} && p\;\text{is even} \\ {\frac{p-1}{2}} && p\;\text{is odd,}}$$ and M = {±1, ±2, … ± 𝜌} called the set of labels. Consider a mapping λ : V → M by assigning different labels in M to the different elements of V when p is even and different labels in M to p - 1 elements of V and repeating a label for the remaining one vertex when p is odd. The labeling as defined above is said to be a pair mean cordial labeling if for each edge uv of G, there exists a labeling $\frac{{\lambda}(u)+{\lambda}(v)}{2}$ if λ(u) + λ(v) is even and $\frac{{\lambda}(u)+{\lambda}(v)+1}{2}$ if λ(u) + λ(v) is odd such that ${\mid}\bar{\mathbb{s}}_{{\lambda}_1}-\bar{\mathbb{s}}_{{\lambda}^c_1}{\mid}\,{\leq}\,1$ where $\bar{\mathbb{s}}_{{\lambda}_1}$ and $\bar{\mathbb{s}}_{{\lambda}^c_1}$ respectively denote the number of edges labeled with 1 and the number of edges not labeled with 1. A graph G with a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling behavior of some union of graphs.