IJPAM: Volume 78, No. 2 (2012)

ONCE MORE ON THE GRACEFULNESS OF
THE DIGRAPHS $n-\vec{C}_{m}$

Zhao Lingqi$^1$, Feng Wei$^2$
$^1$College of Computer Science and Technology
Inner Mongolian University for Nationalities
Tongliao, 028043, P.R. CHINA
$^2$College of Mathematics
Inner Mongolian University for Nationalities
Tongliao, 028043, P.R. CHINA


Abstract. A digraph $ D(V,E)$ is said to be graceful if there exists an injection $f:V(D) \rightarrow \{0, 1, \cdots, \vert E\vert \}$ such that the induced function $f':E(D) \rightarrow \{1, 2, \cdots, \vert E\vert \}$ which is defined by $f^{'}(u,v)=[ f(v)-f(u) ]\pmod {(\vert E\vert+1)}$ for every directed edge $(u,v)$ is a bijection. Here, $f$ is called a graceful labeling (graceful numbering) of digraph $ D(V,E)$, and $f'$ is called the induced edge's graceful labeling of digraph $ D(V,E)$. In this paper we discuss the gracefulness of the digraph $n-\vec{C}_{m}$ and prove the digraph $n-\vec{C}_{19}$ is graceful for even $n$ with more regular labeling than [9].

Received: November 27, 2011

AMS Subject Classification:

Key Words and Phrases: digraph, directed cycles, graceful graph, graceful labeling

Download paper from here.


Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2012
Volume: 78
Issue: 2