International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 64 - Issue 22 |
Published: February 2013 |
Authors: S. Murugesan, D. Jayaraman, J. Shiama |
![]() |
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
@article{ 10.5120/10774-5592, author = { S. Murugesan,D. Jayaraman,J. Shiama }, title = { Square Divisor Cordial Graphs }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 64 }, number = { 22 }, pages = { 1-4 }, doi = { 10.5120/10774-5592 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A S. Murugesan %A D. Jayaraman %A J. Shiama %T Square Divisor Cordial Graphs%T %J International Journal of Computer Applications %V 64 %N 22 %P 1-4 %R 10.5120/10774-5592 %I Foundation of Computer Science (FCS), NY, USA
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.