Some totally modular cordial graphs
Discussiones Mathematicae. Graph Theory, Tome 22 (2002) no. 2, pp. 247-258

Voir la notice de l'article provenant de la source Library of Science

In this paper we define total magic cordial (TMC) and total sequential cordial (TSC) labellings which are weaker versions of magic and simply sequential labellings of graphs. Based on these definitions we have given several results on TMC and TSC graphs.
Keywords: graph labeling, cordial labeling, magic and sequential graphs
@article{DMGT_2002_22_2_a3,
     author = {Cahit, Ibrahim},
     title = {Some totally modular cordial graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {247--258},
     publisher = {mathdoc},
     volume = {22},
     number = {2},
     year = {2002},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2002_22_2_a3/}
}
TY  - JOUR
AU  - Cahit, Ibrahim
TI  - Some totally modular cordial graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2002
SP  - 247
EP  - 258
VL  - 22
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2002_22_2_a3/
LA  - en
ID  - DMGT_2002_22_2_a3
ER  - 
%0 Journal Article
%A Cahit, Ibrahim
%T Some totally modular cordial graphs
%J Discussiones Mathematicae. Graph Theory
%D 2002
%P 247-258
%V 22
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2002_22_2_a3/
%G en
%F DMGT_2002_22_2_a3
Cahit, Ibrahim. Some totally modular cordial graphs. Discussiones Mathematicae. Graph Theory, Tome 22 (2002) no. 2, pp. 247-258. http://geodesic.mathdoc.fr/item/DMGT_2002_22_2_a3/