Cordial Labeling of Cosplitting Graphs

R.Sridevi; S.Vivetha

doi:https://doi.org/10.14445/22315381/IJETT-V32P205

Research Article | Open Access | Download PDF

Volume 32 | Number 1 | Year 2016 | Article Id. IJETT-V32P205 | DOI : https://doi.org/10.14445/22315381/IJETT-V32P205

Cordial Labeling of Cosplitting Graphs

R.Sridevi, S.Vivetha

Citation :

R.Sridevi, S.Vivetha, "Cordial Labeling of Cosplitting Graphs," International Journal of Engineering Trends and Technology (IJETT), vol. 32, no. 1, pp. 26-28, 2016. Crossref, https://doi.org/10.14445/22315381/IJETT-V32P205

Abstract

The cosplitting graph CS(G) is obtained from G, by adding a new vertex w for each vertex v ? V and joining to those vertices of G which are not adjacent to v in G. In this paper, we proved that the cosplitting graph of path, cycle, complete bipartite graph, wheel and star graph are cordial.

Keywords

Cordial labeling, Cosplitting graph.

References

[1] J. A. Gallian, A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, 18, #DS6, 2011.
[2] F. Harary, Graph theory, Addison Wesley, Reading, Massachusetts, 1972.
[3] A. Rosa, On Certain Valuations of the vertices of a Graph, In: Theory of Graphs, (International Symposium, Rome, July 1966), Gordan and Breach, N. Y. and Dunod Paris, 349 - 355.
[4] Selvam Avadayappan and M.Bhuvaneshwari, Cosplitting and Co-regular graphs, IJMSC, Vol 5 - No(1), (2015) 57-64.