# Difference Cordial Labeling of Subdivision of Snake Graphs

@inproceedings{Ponraj2013DifferenceCL, title={Difference Cordial Labeling of Subdivision of Snake Graphs}, author={R. Ponraj and Sreelatha S Narayanan and R. Kala}, year={2013} }

- Published 2013

Let G be a (p, q) graph. Let f : V (G) → {1, 2 . . . , p} be a function. For each edge uv, assign the label |f (u)− f (v)|. f is called a difference cordial labeling if f is a one to one map and |ef (0)− ef (1)| ≤ 1 where ef (1) and ef (0) denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordial labeling behavior of subdivision of some snake… CONTINUE READING

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

## Some results and examples on difference cordial graphs

View 4 Excerpts

Highly Influenced

#### References

##### Publications referenced by this paper.

Showing 1-7 of 7 references

## Difference cordiality of some graphs obtained from double alternate snake graphs

View 1 Excerpt

## Differ - ence cordial labeling of corona graphs

## Difference cordial labeling of corona graphs,J

View 1 Excerpt

## Difference cordial labeling of graphs

View 3 Excerpts

## Difference cordial labeling of graphs obtained from double snakes

View 1 Excerpt

## A Dynamic Survey of Graph Labeling

View 1 Excerpt

## Graph theory, Addision wesley

View 2 Excerpts