The cordiality of one-point union of \(n\) copies of a graph
type: Item
instance of: scholarly article
title: The cordiality of one-point union of \(n\) copies of a graph
zbMATH Open document ID: 0781.05045
DOI: 10.1016/0012-365X(93)90337-S
author: Sze-Chin Shee
author: Yong-Song Ho
published in: Discrete Mathematics
publication date: 1993-11-09T00:00:00Z
review text: This paper gives a contribution on vertex labelings---the so-called cordial labellings---of graphs. The two authors succeed in determining interesting classes of cordial graphs defined as amalgamation of \(n\) copies of a graph. It is remarkable that they are able to develop a theory of cordial graphs by applying results, methods and facts of the theory of solution of equations and inequalities. So they can prove some necessary and sufficient conditions for the cordiality of their special classes of graphs. It remains open whether it is possible to generalize this method in an appropriate way to find a theory of determining the set of all cordial graphs. This paper can be considered as an encouragement for continuing research on cordial graphs.
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 428010
zbMATH Keywords: vertex labelings
zbMATH Keywords: cordial labellings
zbMATH Keywords: cordial graphs
zbMATH Keywords: amalgamation
zbMATH Keywords: cordiality
reviewed by: Rainer Bodendiek
MaRDI profile type: Publication
cites work: Q5422499
cites work: Q4724671
cites work: Q3825114
description: scientific article; zbMATH DE number 428010