The week's pick
Reseach Article
3-Total Edge Sum Cordial Labeling for Some Graphs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 129 - Number 8 |
| Year of Publication: 2015 |
| Authors: Abha Tenguria, Rinku Verma |
10.5120/ijca2015906992
|
Abha Tenguria, Rinku Verma . 3-Total Edge Sum Cordial Labeling for Some Graphs. International Journal of Computer Applications. 129, 8 ( November 2015), 1-3. DOI=10.5120/ijca2015906992
Abstract
The sum cordial labeling is a variant of cordial labeling. Here a variant of 3-total sum cordial labeling was introduced and name it as 3-total edge sum cordial labeling unlike in 3-total sum cordial labeling the roles of vertices and edges are interchanged. Here in this paper path graph, cycle graph and complete bipartite graph k1, n are investigated on this newly defined concept.
References
- Cahit I., ”Cordial graphs: A weaker version of graceful and harmonious graphs” Ars combinatorial 23, 201-207, (1987).
- Gallian J. A., ”A dynamic survey of graph labeling”, The Electronics journal of Combinatorics, 17, (2010) DS6.
- Harrary F., Graph theory, Narosa Publishing House, (2001).
- Shiama J., ”Sum cordial labeling for some graphs”, IJMA- 3(a), 3271-3276, sept-(2012).
- Tenguria Abha and Verma Rinku, ”3-Total super sum cordial labeling for some graphs” IJMA, 5 (12), 117-121, (2014).
- Tenguria Abha and Verma Rinku, ”3-Total super product cordial labeling for some graphs” International Journal of Science and Research - 4(2), 557-559, February (2015).
- Sundaram M., Ponraj R. and Somasundaram S.,” Product cordial labeling of graphs”, Bull. Pure and Applied Sciences (Mathematics and Statistics) 23E 155-163 (2004).
- Vaidya S. K. and Barasara C. M., ”Edge product cordial labeling of graphs”, J. Math Comput. Sci. 2(5), 1436-1450, (2012).
Index Terms
Keywords