Prime Cordial Labeling of Some Graphs

• 作者: Nirav H. Shah Samir K. Vaidya
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: PRIME CORDIAL LABELING SPLIT GRAPH Square GRAPH Middle GRAPH
• 年，卷（期）: 2012,（1）
• 页码范围: 11-16
• 页数: 6页
• 分类号: O1

摘要

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.