 Generic
Number - 1516 |
| References
- 0 |
| Written
Date -
May 16th, 14 |
| Modified
Date -
May 16th, 14 |
| Downloaded
Counts - 1270 |
| Visited
Counts - 1355 |
| |
| Original
File |
|
|
|
| Summary |
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.
|
|
Difference cordiality of some snake graphs
