Quadrilateral Lateral Snake Gluing of Path and Bistar are Prime Cordial Graphs

Authors

  • I Tamilselvi

  • P Selvaraju

  • S Gayathri

Received date: September 11, 2018

Accepted date: September 11, 2018

DOI:

https://doi.org/10.14419/ijet.v7i3.34.19467

Keywords:

Graph labeling, Prime cordial labeling, bistar graph, Path graph and Quadrilateral Snake graph.

Abstract

The graph is called a Quadrilateral Snake graph. Which is defined as series connection of non-adjacent vertices of ‘N’ number of cycle    and these vertex set    and edge set   are described below

 

 

 

Figure 1: Quadrilateral Snake graph

 

A prime cordial labeling of a graph G with vertex set V(G) is a bijection    such that  each edge   is assigned the label 1 if   and 0 if   then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph which admits a prime cordial labeling is called a prime cordial graph.

In this paper we prove that the graphs,   

 

 

 

References

  1. [1] CahitI, Cordial Graphs, A weaker version of graceful and harmonious Graphs, Ars Combinatoria, 23(1987), 201-207.

    [2] Gallian J. A, A dynamic survey of graph labeling, the electronic J. Combinatorics, 5(2011),#DS6. http://www.combinatorics.org

    [3] Ho Y S., Lee S M. and Shee S C., Cordial labeling of unicyclic graphs and generalized Petersen graphs, Congress. Number. 68(1989), 109-122. Rosa A., on certain valuations of the vertices of a graph, Theory of Graphs(Internat.Symposium, Rome, July (1966), Gorden and Breach, N.Y.andDunod Paris (1967) 349-355.

    [4] Sundaram. M., Ponraj. R and Somasundaram. S., Total Product Cordial labeling of Graphs.BullPure and applied sciences(Mathematics and Statistics).(2006), 199-203.

    [5] Tamilselvi.L., New Classes of graphs relating to Quadrilateral Snake using valuation, odd graceful, Felicitous, Mean and Cordial labeling, Ph.D.Thesis,VMU (2013).

    [6] M.Sundaram,R.Ponraj and S. Somasundram, “Prime Cordial Labeling of Graphs,†Journal of the Indian Academy of Mathematics, Vol. 27, No. 2, 2005 , pp. 373- 390.

    [7] S. K. Vaidya and P. L. Vihol, “Prime Cordial Labeling for Some Graphs,†Modern

    [8] Applied Science, Vol. 4, No. 8, 2010, pp. 119-126.

Downloads

How to Cite

Tamilselvi, I., Selvaraju, P., & Gayathri, S. (2018). Quadrilateral Lateral Snake Gluing of Path and Bistar are Prime Cordial Graphs. International Journal of Engineering and Technology, 7(3.34), 747-751. https://doi.org/10.14419/ijet.v7i3.34.19467

Received date: September 11, 2018

Accepted date: September 11, 2018