One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial

DOI10.1016/S0012-365X(02)00305-9zbMath1008.05130MaRDI QIDQ1861231

G. Sethuraman, P. Selvaraju

Publication date: 16 March 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cordial labelinggraph labelingone edge union of shell graphsone vertex union of complete bipartite graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

Graceful and cordial labeling of subdivision of graphs

This page was built for publication: One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial