3-Equitable Prime Cordial Labeling of Standard Splitting Graphs
Keywords:
Cordial labeling, 3-equitable Prime cordial labeling, Splitting graph, cycle, path, bistar and wheelAbstract
A 3-equitable prime cordial labeling is extension of prime cordial labeling .Splitting graph S^` (G) was introduced by Sampath Kumar and Walikar. For a graph G the splitting graphS` of G is obtained by adding a new vertex v` corresponding to each vertex v of G such that N(v)=N(v^` ). In this paper we prove the splitting graph of cycleC_n, path P_n, bistar B_(n,n) and wheel W_n admits 3-equitable prime cordial labeling.
References
[1] Cahit, Cordial graphs: A weaker version of graceful and harmonious graphs, ArsCombinatoria, Vol 23, pp. 201-207, 1987.
[2] J. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics, 16, 2017.
[3] F. Harary Graph Theory, Addition-Wesley, Reading Mass, 1972.
[4] S.Murugesan et al “3-equitable Prime Cordial labeling of graphs”, Internatinal journal of Applied Information Systems, volume 5July 2013.
[5] Rosa A, (1966) “On certain valuation of the vertices of a Graph theory of graphs” Int.Symposium Rome, Gordon and Breach, N Y Dound, Paris pp. 349-355.
[6] E.Sampathkumar and H.B. Walikar, On Splitting Graph of a Graph, J.Karnatak Univ. Sci., vol 25(13)(1980), pp 13-16.
[7] M.Sundaram, R.Ponraj and S.Somasundaram, Prime cordial labeling of graphs, Journal of Indian Academy of Mathematics, vol 27(2005), pp 373-390
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
