3-Equitable prime cordial labeling of different graphs

Jasmin Priyadarsini Jena, Gaurang V Ghodsara

Abstract


In this paper we have derived characterization result on $3$-equitable prime cordial labeling. We also discuss $3$-equitable prime cordial labeling of cycle, wheel, fan $F_{n}$ for $n \geq 5$ and prism related graphs.

Full Text:

PDF

References


bibitem{Rosa} A. Rosa, textit{On certain valuations of the vertices of a graph}, Theory of Graphs (Inter-

national Symposium, Rome, July $1966$), Gordon and Breach, N. Y. and Dunod Paris $(1967), 349-355$.

bibitem{Burton} D. M. Burton, textit{Elementary Number Theory}, Second

Edition, Wm. C. Brown Company Publishers, 1980.

%

bibitem{Gross}J. Gross and J. Yellen, textit{Graph Theory and its Applications}, CRC Press, 1999.

%

bibitem{Gallian}J. A. Gallian,textit{ A dynamic survey of graph labeling},

The Electronics Journal of Combinatorics, 19(2016), $sharp DS6$, 1-408.

%

bibitem{Gvg}G. V. Ghodasara, textit{Some investigations in the theory of graphs}, Ph. D. Thesis, $2008$.

%

bibitem{Murugesan}S. Murugesan, D. Jayaraman and J. Shiama, textit{$3$-equitable prime cordial labeling of graphs}, International Journal of Applied Information Systems, 5(9)(2013), 1-4.


Refbacks

  • There are currently no refbacks.




Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.