One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial
type: Item
instance of: scholarly article
title: One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial
zbMATH Open document ID: 1008.05130
DOI: 10.1016/S0012-365X(02)00305-9
author: G. Sethuraman
author: P. Selvaraju
published in: Discrete Mathematics
publication date: 2003-03-16T00:00:00Z
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 1882168
zbMATH Keywords: graph labeling
zbMATH Keywords: cordial labeling
zbMATH Keywords: one edge union of shell graphs
zbMATH Keywords: one vertex union of complete bipartite graphs
MaRDI profile type: Publication
Recommended article: Q3070267
Recommended article: ONE VERTEX UNION OF SHELL GRAPHS WITH A PATH AT ANY COMMON LEVEL IS CORDIAL
Recommended article: Q3012405
Recommended article: The cordiality of one-point union of \(n\) copies of a graph
Recommended article: On graceful graphs: One vertex unions of non-isomorphic complete bipartite graphs
Recommended article: Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
Recommended article: Q5488896
Recommended article: Intersection cordiality of union of some standard graphs
Recommended article: Q5224840
Recommended article: Q5397254
description: scientific article; zbMATH DE number 1882168