PRODUCT CORDIAL LABELING OF LINE GRAPH OF SOME GRAPHS

被引：0

作者：

Vaidya, S. K. ^{[1
]}

Barasara, C. M. ^{[2
]}

机构：

[1] Saurashtra Univ, Dept Math, Rajkot 360005, Gujarat, India

[2] Atmiya Inst Technol & Sci, Rajkot 360005, Gujarat, India

来源：

KRAGUJEVAC JOURNAL OF MATHEMATICS | 2016年 / 40卷 / 02期

关键词：

Cordial labeling; product cordial labeling; line graph;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The line graph L (G) of a graph G is the graph whose vertex set is E (G) and two vertices are adjacent in L (G) whenever they are incident in G. In this paper we have investigated product cordial labeling of line graph of some product cordial graphs.

引用

页码：290 / 297

页数：8