The week's pick
Random Articles
Reseach Article
Square Divisor Cordial Graphs
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 64 - Number 22 |
| Year of Publication: 2013 |
| Authors: S. Murugesan, D. Jayaraman, J. Shiama |
10.5120/10774-5592
|
S. Murugesan, D. Jayaraman, J. Shiama . Square Divisor Cordial Graphs. International Journal of Computer Applications. 64, 22 ( February 2013), 1-4. DOI=10.5120/10774-5592
Abstract
A square divisor cordial labeling of a graph G with vertex set V is a bijection f from V to f1; 2; : : : ; j V jg such that if each edge uv is assigned the label 1 if [f (u)]2jf (v) or [f (v)]2jf (u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. If a graph has a square divisor cordial labeling, then it is called square divisor cordial graph. In this paper, we investigate the square divisor cordial labeling behaviour of paths, cycles, wheel graphs, star graphs, some complete bipartite graphs and complete graphs.
References
- I. Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars combinatoria, 23(1987), 201-207.
- I. Cahit, On cordial and 3-equitable labelings of graph, Utilitas Math, 370(1990), 189-198.
- David M. Burton, Elementary Number Theory, Second Edition,Wm. C. Brown Company Publishers, 1980.
- J. A. Gallian, A dynamic survey of graph labeling, Electronic Journal of Combinatorics, 17 (2010), DS6.
- F. Harary, Graph Theory, Addition-Wesley, Reading, Mass, 1972.
- M. Sundaram, R. Ponraj and S, Somasundaram, Prime cordial labeling of graphs, Journal of Indian Academy of Mathematics, 27(2005), 373-390.
- R. Varatharajan, S. Navaneethakrishnan and K. Nagarajan, Divisor cordial graphs, International J. Math. Combin. Vol. 4(2011), 15-25.
- R. Varatharajan, S. Navaneethakrishnan and K. Nagarajan, Special classes of divisor cordial graphs, International Mathematical Forum, Vol. 7, 2012, no. 35, 1737-1749.
Index Terms
Keywords