ISSN 2234-8417 (Online) ISSN 1598-5857 (Print)

Table of Contents
2014's   32,3-4(May)
  Difference cordiality of some snake graphs
    By R. Ponraj ..........1516
Generic Number - 1516
References - 0
Written Date - May 16th, 14
Modified Date - May 16th, 14
Downloaded Counts - 104
Visited Counts - 624
Original File
Let $G$ be a $\left(p,q\right)$ graph. Let $f$ be a map from $V\left(G\right)$ to
$\left\{1,2,\dots, p\right\}$. For each edge $uv$, assign the label $\left|f\left
(u\right)-f\left(v\right)\right|$. $f$ is called a difference cordial labeling if $f$ is
a one to one map and $\left|e_{f}\left(0\right)-e_{f}\left(1\right)\right|\leq 1$
where $e_{f}\left(1\right)$ and $e_{f}\left(0\right)$ denote the number of edges
labeled with $1$ and not labeled with $1$ respectively. A graph with admits a
difference cordial labeling is called a difference cordial graph. In this paper, we
investigate the difference cordial labeling behavior of triangular snake, Quadrilateral
snake, double triangular snake, double quadrilateral snake and alternate snakes.

학회 : 정보전산응용수학회(KSICAM) (구: KSCAM & Korean SIGCAM)
연구소 : SPCHIN 전산응용수학연구소 ( SPCHIN-CAM Institute : SPCHIN-CAMI)
Copyright ⓒ 2021 JAMC, JAMI. All rights reserved.  E-mail :
Main Office : c/o Springer Tiergartenstrasse 17 D-69121 Heidelberg, GERMANY.