Document Type

Journal Article

Department/Unit

Department of Mathematics

Abstract

Let G=(V,E) be a (p,q)-graph. Let be a bijection. The induced mapping of f is defined by for uV. 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 PmNn, where there are mnvertices and (m−1)n2 edges. We show that P3Nn is edge-graceful if n is odd.

Publication Year

2002

Journal Title

Discrete Mathematics

Volume number

253

Issue number

1-3

Publisher

Elsevier

First Page (page number)

63

Last Page (page number)

76

Referreed

1

DOI

10.1016/S0012-365X(01)00449-6

ISSN (print)

1872681X

Keywords

Edge-graceful, Composition of graph, Labeling matrix

Included in

Mathematics Commons

Share

COinS