Distance Two Labeling of Direct Product of Paths and Cycles

dc.contributor.author	Adefokun Tayo Charles
dc.contributor.author	Ajayi Deborah Olayide
dc.date.accessioned	2025-06-25T12:21:14Z
dc.date.available	2025-06-25T12:21:14Z
dc.date.issued	2013
dc.description.abstract	Suppose that [n] = {0, 1, 2, ..., n} is a set of non-negative integers and h, k ∈ [n]. The L(h, k)-labeling of graph G is the function l : V (G) → [n] such that \|l(u) − l(v)\| ≥ h if the distance d(u, v) between u and v is one and \|l(u) − l(v)\| ≥ k if the distance d(u, v) is two. Let L(V (G)) = {l(v) : v ∈ V (G)} and let p be the maximum value of L(V (G)). Then p is called k h−number of G if p is the least possible member of [n] such that G maintains an L(h, k)−labeling. In this paper, we establish 1 1− numbers of Pm × Cn graphs for all m ≥ 2 and n ≥ 3.
dc.identifier.citation	Adefokun, T. C. and Ajayi, D. O. (2013). Distance Two Labeling of Direct Product of Paths and Cycles. arXiv preprint.
dc.identifier.uri	https://repository.crawforduniversity.edu.ng/handle/123456789/323
dc.language.iso	en
dc.publisher	arXiv preprint
dc.title	Distance Two Labeling of Direct Product of Paths and Cycles
dc.type	Article

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1