No Detail Found!

On the gracefulness of the digraphs n – cm for m odd.

Author(s)
Zhao Lingqi College of Mathematics and Computer Science, Inner Mongolian University for Nationalities, 028043, P.R. China
Jirimutu College of Mathematics and Computer Science, Inner Mongolian University for Nationalities, 028043, P.R. China
Xirong Xu Department of Computer Science, Dalian University of Technology, 116024, P.R. China
Wang Lei Department of Computer Science, Dalian University of Technology, 116024, P.R. China
Abstract
A digraph D(V,E) is said to be graceful if there exists an injection f : V(G) ® {0,1,…,÷E÷} such that the induced function f’ : E(G) ® {1,2,…,÷E÷} which is defined by f’(u,v) = [f(v)-f(u)] (mod ÷E÷+1) for every directed edge (u,v) is a bijection. Here, f is called a graceful labeling (graceful numbering) of D(V,E), while f’ is called the induced edge’s graceful labeling of D. In this paper we discuss the gracefulness of the digraph n – Cm and prove that n – Cm is a graceful digraph for m – 5,7,9,11,13 and even n.
Publication Details
Page(s) 118-126
DOI DOI not available
Published Journal: Journal of Prime Research in Mathematics, Volume: 4, Issue: 0, Year: 2008

Request the full text from PASTIC

0

Citations

0

Downloads

62

Views