Volume 39 | Number 1 | Year 2016 | Article Id. IJMTT-V39P507 | DOI : https://doi.org/10.14445/22315373/IJMTT-V39P507
A vertex labeling f:V(G)→{-1,1} of a graph G with induced edge labeling f^*:E(G)→{-1,1} defined by f^* (uv)=f(u)f(v) is called a signed product cordial labeling if the number of vertices with labels -1 and +1 differs at most 1 as well as the number of edges with labels -1 and +1 differs at most 1. In this paper, we prove some results on signed product cordial labeling of graphs in the context of path union at vertex of flower F_n, binary tree and star. Also, we prove total graph of path P_n and K_(1,n)⊙G^' (G^' be the null graph with two vertices) are signed and total signed product cordial labeling graphs.
[1]. M. Andar, S.Boxwala and N.B. Limaye, Cordial labeling of some wheel related graphs, J.Combin, Math. Combin. Comput.,41(2002), 203-208.
[2]. M. Andar, S. Boxwala and N.B. Limaye, A note on cordial labeling of multiple shells, Trends Math.,(2002), 77-80.
[3]. J.Baskar Babujee and Shobana Loganathan, Cordial languages and Cordial Numbers, Journal of Applied Computer Science and Mathematics.
[4]. J.Baskar Babujee and Shobana Loganathan, On signed product cordial labeling, Applied Mathematics, Vol.2, 1525-1530, 2011.
[5]. I.Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, Ars Combin., 23(1987), 201-207.
[6]. R.L. Graham and N.J. A. Sloane, On additive bases and harmonious graphs, SIAM J. Algebr. Disc. Meth., 1(4) (1980), 382- 404.
[7]. R Frucht and F Harary., On the corona two graphs, Aequationes Math., (1970),4, 322- 325.
[8]. J. Gross and J. Yellen, Graph Theory and its applications, CRC Press, (1999).
[9]. Ismael G. Yero and Juan A. On the Randic index of Corona product Graphs, Rodriguez-Velazquez.,(2014), Mosul University.
[10]. P.Lawrence Rozario Raj and S.Koilraj, Cordial labeling for the spliting graph of some standard graphs, International Journal of Mathematics and Soft Computing, 1(1)(2011), 105-114.
[11]. A. Rosa, On certain valuations of the vertices of a graph, Theory of graphs, International Symposium, Rome, July (1966), Gordon and Breach, New York and Dunod Paris, (1967), 349- 355.
[12]. M. Santhi.M., and A. James Albert, Signed product cordial labeling and Total signed cordial labeling for some New Graphs, International Journal of Research in Applied, Natural and Social sciences ,2015,Vol.3,Issue 1,133-138.
[13]. S.C. Shee, and Y.S. Ho, “ The cardiality of path- union of n copies of a graph”, Discrete Math., 151(1996), 221-229.
[14]. S.K.Vaidya, and N.A.Dani, Some new star related graphs and their cordial as well as 3- equitable labeing, Journal of Sciences, 1(1) (2010), 111114.
[15]. S.K. Vaidya and N.A. Dani, Cordial labeling and arbitrary super subdivision of some graphs, International Journal of Information Science and Computer Mathematics, 2(1) (2010), 51-60.
[16]. S.K.Vaidya and P.L.Vihol, Cordial labeling for Middle Graph of Some Graphs, Elixir Discrete Mathematics, (2011), 2468-2476.
[17]. S.K.Vaidya and N.H.Shah, Cordial labeling for Some Bistar Related Graphs, International Journal of MAthematics and Soft Computing, 4(2)(2014), 33-39.
[18]. S.K.Vaidya and N.H. Shah, Cordial labeling of Snakes, International Journal of Mathematics And its Applications, 2(3) (2014), 17-27.
M. Santhi K. Kalidass, "Some Graph Operations on Signed Product Cordial Labeling Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 39, no. 1, pp. 42-52, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V39P507