On the gracefulness of the digraph P→a,b
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, • • •, 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 of D(V,E), and f' is called the induced edge's graceful labeling of D. In this paper we discuss the gracefulness of the digraph P→a,b, and prove P→a,b is graceful if and only if both a and b are odd.
Published
2016-09-09
How to Cite
Lingqi, Zhao, Yuansheng, Yang, Wei, Feng, Yuan, Ren, & Jingjing, Bao. (2016). On the gracefulness of the digraph P→a,b. Utilitas Mathematica, 101. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1143
Issue
Section
Articles