|
|||||
|
|
One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial |
|
| Institution: | School of Mathematics, Anna University, Chennai 600025, India |
| 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: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |