• 충청수학회지
• /
• 제34권3호
• /
• pp.285-294
• /
• 2021

In the present work we introduce Gaussian vertex prime labeling and investigate Gaussian vertex prime labeling for gear graph, book graph, wheel graph, kayak paddle, one point union of gear graph and one point union of wheel graph.

• Journal of applied mathematics & informatics
• /
• 제41권3호
• /
• pp.615-631
• /
• 2023

A power cordial labeling of a graph G = (V (G), E(G)) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge e = uv is assigned the label 1 if f(u) = (f(v))ⁿ or f(v) = (f(u))ⁿ, For some n ∈ ℕ ∪ {0} and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we investigate power cordial labeling for helm graph, flower graph, gear graph, fan graph and jewel graph as well as larger graphs obtained from star and bistar using graph operations.

• Journal of Applied and Pure Mathematics
• /
• 제5권3_4호
• /
• pp.237-253
• /
• 2023

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 for which there exists a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling behavior of few graphs including the closed helm graph, web graph, jewel graph, sunflower graph, flower graph, tadpole graph, dumbbell graph, umbrella graph, butterfly graph, jelly fish, triangular book graph, quadrilateral book graph.

• Journal of applied mathematics & informatics
• /
• 제34권3_4호
• /
• pp.227-237
• /
• 2016

In this paper we introduce a new graph labeling called k-prime cordial labeling. Let G be a (p, q) graph and 2 ≤ p ≤ k. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called a k-prime cordial labeling of G if |v_f (i) − v_f (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |e_f (0) − e_f (1)| ≤ 1 where v_f (x) denotes the number of vertices labeled with x, e_f (1) and e_f (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate the k-prime cordial labeling behavior of a star and we have proved that every graph is a subgraph of a k-prime cordial graph. Also we investigate the 3-prime cordial labeling behavior of path, cycle, complete graph, wheel, comb and some more standard graphs.

• 대한수학회보
• /
• 제59권1호
• /
• pp.119-139
• /
• 2022

This paper deals with the λ-labeling and L(2, 1)-coloring of simple graphs. A λ-labeling of a graph G is any labeling of the vertices of G with different labels such that any two adjacent vertices receive labels which differ at least two. Also an L(2, 1)-coloring of G is any labeling of the vertices of G such that any two adjacent vertices receive labels which differ at least two and any two vertices with distance two receive distinct labels. Assume that a partial λ-labeling f is given in a graph G. A general question is whether f can be extended to a λ-labeling of G. We show that the extension is feasible if and only if a Hamiltonian path consistent with some distance constraints exists in the complement of G. Then we consider line graph of bipartite multigraphs and determine the minimum number of labels in L(2, 1)-coloring and λ-labeling of these graphs. In fact we obtain easily computable formulas for the path covering number and the maximum path of the complement of these graphs. We obtain a polynomial time algorithm which generates all Hamiltonian paths in the related graphs. A special case is the Cartesian product graph K_n☐K_n and the generation of λ-squares.

• Journal of Applied and Pure Mathematics
• /
• 제6권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.

• Journal of Applied and Pure Mathematics
• /
• 제4권3_4호
• /
• pp.85-97
• /
• 2022

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 for which there exists a pair mean cordial labeling is called a pair mean cordial graph. In this paper, we investigate the pair mean cordial labeling of graphs which are obtained from path and cycle.

• Journal of applied mathematics & informatics
• /
• 제42권2호
• /
• pp.445-456
• /
• 2024

A power cordial labeling of a graph G = (V (G), E(G)) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge e = uv is assigned the label 1 if f(u) = (f(v))ⁿ or f(v) = (f(u))ⁿ, for some n ∈ ℕ ∪ {0} {0} and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we study power cordial labeling and investigate power cordial labeling for some standard graph families.

• Journal of Applied and Pure Mathematics
• /
• 제4권1_2호
• /
• pp.51-61
• /
• 2022

Let G be a graph. Let f : V (G) → {0, 1, 2, …, k-1} be a map where k ∈ ℕ and k > 1. For each edge uv, assign the label |f(u) - f(v)|. f is called k-total difference cordial labeling of G if |t_df (i) - t_df (j) | ≤ 1, i, j ∈ {0, 1, 2, …, k - 1} where t_df (x) denotes the total number of vertices and the edges labeled with x. A graph with admits a k-total difference cordial labeling is called k-total difference cordial graphs. In this paper we investigate the 4-total difference cordial labeling behaviour of shell butterfly graph, Lilly graph, Shackle graphs etc..

• Journal of applied mathematics & informatics
• /
• 제41권2호
• /
• pp.321-330
• /
• 2023

Let G = (V, E) be a graph. Consider the group S₃. Let g : V (G) → S₃ be a function. For each edge xy assign the label 1 if ${\lceil}{\frac{o(g(x))+o(g(y))}{2}}{\rceil}$ is odd or 0 otherwise. g is a group S₃ mean cordial labeling if |v_g(i) - v_g(j)| ≤ 1 and |e_g(0) - e_g(1)| ≤ 1, where vg(i) and e_g(y)denote the number of vertices labeled with an element i and number of edges labeled with y (y = 0, 1). The graph G with group S₃ mean cordial labeling is called group S₃ mean cordial graph. In this paper, we discuss group S3 mean cordial labeling for star related graphs.