Path Related Product Cordial Graph

Select Volume / Issue:

• Volume 2,Issue 4, July 2014

Year:

2014

Type of Publication:

Article

Keywords:

Fan, Comb, Join of Two Graphs, Product Cordial Labeling, Product Cordial Graph

Authors:

A. Nellai Murugan; A. Meenakshi Sundari

Journal:

IJISM

Volume:

2

Number:

4

Pages:

381-383

Month:

July

Abstract:

Let G = (V,E) be a graph with p vertices and q edges. A Product cordial labeling of a Graph G with vertex set V is a bijection from V to {0,1} such that if each edge uv is assigned the label (f(u).f(v)) with the condition the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by atmost 1and the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. The graph that admits a product cordial labeling is called a product cordial graph (PCG). In this paper, we proved that path related graphs Path Pn , Fan Pn+K1 , [Pn : Sm] : (n - even) , comb Pn K1 , [Pn : Cm]: (n-even) are product cordial graphs.

Full text: IJISM_206_Final.pdf [Bibtex]