Year: 2011
Author: Zhishang Zhang, Qingcheng Zhang, Chunyue Wang
Communications in Mathematical Research , Vol. 27 (2011), Iss. 2 : pp. 139–146
Abstract
The present paper deals with the gracefulness of unconnected graph $(jC_{4n}) ∪ P_m$, and proves the following result: for positive integers $n$, $j$ and $m$ with $n ≥ 1$, $j ≥ 2$, the unconnected graph $(jC_{4n}) ∪ P_m$ is a graceful graph for $m = j − 1$ or $m ≥ n + j$, where $C_{4n}$ is a cycle with $4n$ vertexes, $P_m$ is a path with $m + 1$ vertexes, and $(jC_{4n}) ∪ P_m$ denotes the disjoint union of $j − C_{4n}$ and $P_m$.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2011-CMR-19096
Communications in Mathematical Research , Vol. 27 (2011), Iss. 2 : pp. 139–146
Published online: 2011-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 8
Keywords: graceful labeling graceful graph path cycle disjoint union.