Prime Cordial Labeling of Some Graphs

Samir K Vaidya,Nirav H Shah

doi:10.4236/ojdm.2012.21003

Abstract

In this paper we prove that the split graphs of K1,n and Bn,n are prime cordial graphs. We also show that the square graph of Bn,n is a prime cordial graph while middle graph of Pn is a prime cordial graph for n≥4 . Further we prove that the wheel graph Wn admits prime cordial labeling for n≥8.

Highlights

2) A rule that assigns a value to each edge; We begin with simple, finite, connected and undirected graph G V G, E G with p vertices and q edges.For standard terminology and notations we follow Gross and Yellen [1]
In this paper we prove that the split graphs of K1,n and Bn,n are prime cordial graphs
We show that the square graph of Bn,n is a prime cordial graph while middle graph of Pn is a prime cordial graph for n 4

Summary

Introduction

2) A rule that assigns a value to each edge; We begin with simple, finite, connected and undirected graph G V G , E G with p vertices and q edges.For standard terminology and notations we follow Gross and Yellen [1]. Further we prove that the wheel graph Wn admits prime cordial labeling for n 8 . Definition 1.4 A binary vertex labeling f of a graph G is called a cordial labeling if v f (0) v f (1) 1 and ef (0) ef (1) 1 .

Results

Conclusion