Geodesic
Product Cordial Labeling of Line Graph of Some Graphs
Kragujevac Journal of Mathematics, Tome 40 (2016) no. 2, p. 290

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

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.
Classification : 05C78 05C76, 05C38
Keywords: Cordial labeling, product cordial labeling, line graph 
@article{KJM_2016_40_2_a11,
     author = {S. K. Vaidya and C. M. Barasara},
     title = {Product {Cordial} {Labeling} of {Line} {Graph} of {Some} {Graphs}},
     journal = {Kragujevac Journal of Mathematics},
     pages = {290 },
     publisher = {mathdoc},
     volume = {40},
     number = {2},
     year = {2016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KJM_2016_40_2_a11/}
}
TY  - JOUR
AU  - S. K. Vaidya
AU  - C. M. Barasara
TI  - Product Cordial Labeling of Line Graph of Some Graphs
JO  - Kragujevac Journal of Mathematics
PY  - 2016
SP  - 290 
VL  - 40
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/KJM_2016_40_2_a11/
LA  - en
ID  - KJM_2016_40_2_a11
ER  - 
%0 Journal Article
%A S. K. Vaidya
%A C. M. Barasara
%T Product Cordial Labeling of Line Graph of Some Graphs
%J Kragujevac Journal of Mathematics
%D 2016
%P 290 
%V 40
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/KJM_2016_40_2_a11/
%G en
%F KJM_2016_40_2_a11
S. K. Vaidya; C. M. Barasara. Product Cordial Labeling of Line Graph of Some Graphs. Kragujevac Journal of Mathematics, Tome 40 (2016) no. 2, p. 290 . http://geodesic.mathdoc.fr/item/KJM_2016_40_2_a11/