R. Kala
Department of Mathematics, Manonmaniam Sundaranar University, Tirunelveli-- 627 012, India
[ 1 ] - k-Remainder Cordial Graphs
In this paper we generalize the remainder cordial labeling, called $k$-remainder cordial labeling and investigate the $4$-remainder cordial labeling behavior of certain graphs.
[ 2 ] - Remainder Cordial Labeling of Graphs
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...
[ 3 ] - Asteroidal number for some product graphs
The notion of Asteroidal triples was introduced by Lekkerkerker and Boland [6]. D.G.Corneil and others [2], Ekkehard Kohler [3] further investigated asteroidal triples. Walter generalized the concept of asteroidal triples to asteroidal sets [8]. Further study was carried out by Haiko Muller [4]. In this paper we find asteroidal numbers for Direct product of cycles, Direct product of path and cy...
[ 4 ] - $k$-Total difference cordial graphs
Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $left|t_{df}(i)-t_{df}(j)right|leq 1$, $i,j in {0,1,2, ldots, k-1}$ where $t_{df}(x)$ denotes the total number of vertices and the edges labeled with $x$.A graph with admits a...
نویسندگان همکار