Premium
Two sets of graceful graphs
Author(s) -
Delorme Charles
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040214
Subject(s) - combinatorics , mathematics , join (topology) , disjoint sets , disjoint union (topology) , enhanced data rates for gsm evolution , product (mathematics) , discrete mathematics , computer science , telecommunications , geometry
We give graceful numberings to the following graphs: (a) the union of n K 4 having one edge in common, in other words the join of K 2 and the union of n disjoint K 2 and (b) the union of n C 4 having one edge in common, in other words the product of K 2 and K 1, n , with n + 1 not a multiple of 4.