Title of article :
One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial
Author/Authors :
G. Sethuraman، نويسنده , , P. Selvaraju، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Pages :
8
From page :
343
To page :
350
Abstract :
In this paper we prove that one edge union of k-copies of shell graphs H(n,n−3) is cordial, for all n⩾4 and k⩾1 and one vertex union of t copies of complete bipartite graph Km,n is cordial.
Keywords :
Cordial labeling , Graph labeling , One vertex union of complete bipartite graphs , One edge union of shell graphs
Journal title :
Discrete Mathematics
Serial Year :
2002
Journal title :
Discrete Mathematics
Record number :
949424
Link To Document :
بازگشت