Keywords:-

Keywords: Cordial labeling, V4Cordial Labeling and V4Cordial Graph. 1.

Article Content:-

Abstract

Let be any abelian group. A graph G = (V(G), E(G)) is said to be A-cordial[6] if there is a mapping f: V(G) A which satisfies the following two conditions with each edge e= uv is labeled as f(u)*f(v). (i)| | 1, a,b A (ii)| | 1, a,b A where = the number of vertices with label a = the number of vertices with label b = the number of edges with label a = the number of edges with label b We note that if A = <V4 , *> is a multiplicative group. Then the labeling is known as V4 Cordial Labeling. A graph is called a V4 Cordial graph if it admits a V4 Cordial Labeling. In this paper,It is proved thatZ-(Pn), Bookand are V4Cordial graphs.

References:-

References

G.J. Gallian, A Dynamic survey of graph labeling, The electronic journal of combinotorics, 16 (2009), #DS6.

S.W Golomb, How to number a graph in graph Theory and computing, R.C. Read, ed., Academic Press, New York (1972), 23-37.

A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs (International Symposium, Rome), July (1966).

Frank Harary, Graph Theory, Narosa publishing house pvt. Ltd.,10th reprint 2001.

J Gross and J Yeiien, Handbook of graph theory, CRC Press,2004.

M. Hovey, A-cordial graphs, Discrete Math.,Vol 93(1991), 183-194.

R. Tao, On k-cordiality of cycles, crowns and wheels, Systems Sci., 11 (1998), 227-229.

M.Z. Youssef, On k-cordial labeling,Australas.J. Combin.,Vol 43(2009),31-37.

M.V.Modha, K.K.Kanani, Some new families of 5-cordial graphs, International Journal of Mathematics and Soft Computing, Vol.5, No.1(2015), 129-141.

L.Pandiselvi, S.NavaneethaKrishnan and A.NellaiMurugan, Path Related V4 Cordial graphs International Journal of Recent advances in Multidisiplinary Research, Vol. 03, Issue 02, pp.1285-1294, February, 2016,

L.Pandiselvi, S.NavaneethaKrishnan and A.NellaiMurugan, Bi-Star V4 Cordial Graphs International Journal Of Advanced Science and Research Vol. 1,Issue 2, Feb 2016. Pg no:14-21.

L.Pandiselvi, A.NellaiMurugan, and S.NavaneethaKrishnanV4 Cordial Graphs of Fan and Globe International Journal of Applied Research2016; 2(4): 344-350.

Downloads

Citation Tools

How to Cite
Pandiselvi, L., Navaneethakrishnan, S., Murugan, A., & Nagarajan, A. (2016). Star Related V4 Cordial graphs. International Journal Of Mathematics And Computer Research, 4(10), 1610-1621. Retrieved from https://ijmcr.in/index.php/ijmcr/article/view/73