DSpace

King Saud University Repository >
King Saud University >
COLLEGES >
Humanities Colleges >
College of Teaching >
College of Teaching >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/11403

Title: Graph labelings and cordiality
Authors: M. Z. Youssef
E. Elsakhawy
Keywords: k-Cordial labeling
graceful labeling
Issue Date: 2010
Abstract: In this paper we show that, if G and H are cordial and one has even size, then GU H is cordial; if G and H are cordial and both have even size, then G + H is cordial; if G and H are cordial and one has even size and either one has even order, then G + H is cordial; Cm U Cn is cordial if and only if m + n /≡ 2 (mod 4); mCn is cordial if and only if mn /≡ 2 (mod 4); Cm + Cn is cordial if and only if (m, n) /= (3, 3) and {m (mod 4), n (mod 4)} /= {0, 2}; and if Pk n is cordial, then n > k + 1 + √k − 2.We conjectures that this latter condition is also sufficient. He confirms the conjecture for k = 5, 6, 7, 8, and 9.
URI: http://hdl.handle.net/123456789/11403
Appears in Collections:College of Teaching

Files in This Item:

File Description SizeFormat
English Summary of psper 5.doc44 kBMicrosoft WordView/Open

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

 

DSpace Software Copyright © 2002-2007 MIT and Hewlett-Packard - Feedback