Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/104273
Title: The cordiality of the path-union of n copies of a graph
Authors: Shee, S.-C. 
Ho, Y.-S.
Issue Date: 10-May-1996
Citation: Shee, S.-C.,Ho, Y.-S. (1996-05-10). The cordiality of the path-union of n copies of a graph. Discrete Mathematics 151 (1-3) : 221-229. ScholarBank@NUS Repository.
Abstract: Let G1, G2,..., Gn be n (≥2) copies of a graph G. We denote by G (n) the graph obtained by adding an edge to Gi and Gi+1, i = 1, 2,..., n - 1, and we call G(n) the path-union of n copies of the graph G. We shall relate the cordiality of the path-union of n copies of a graph to the solution of a system involving an equation and two inequalities, and give some sufficient conditions for that path-union to be cordial. The path-unions of such graphs as cycles, wheels, fans, some cliques, Cartesian products and compositions of some graphs are shown to be cordial.
Source Title: Discrete Mathematics
URI: http://scholarbank.nus.edu.sg/handle/10635/104273
ISSN: 0012365X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

44
checked on Aug 17, 2019

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.