Department of Mathematics
Let G=(V,E) be a (p,q)-graph. Let be a bijection. The induced mapping of f is defined by for u∈V. If f+ is a bijection, then G is called edge-graceful. In this paper, we investigate the edge-gracefulness of the composition of paths with null graphs Pm∘Nn, where there are mnvertices and (m−1)n2 edges. We show that P3∘Nn is edge-graceful if n is odd.
Edge-graceful, Composition of graph, Labeling matrix
Source Publication Title
Link to Publisher's Edition
Shiu, Wai Chee, Peter Che Bor Lam, and Hee Lin Cheng. "Edge-gracefulness of the composition of paths with null graphs." Discrete Mathematics 253.1-3 (2002): 63-76.