Keywords:-

Keywords: Poset, Chain, Graph labeling

Article Content:-

Abstract

The concept of graph labeling was introduced in mid-1960 by Rosa. In this paper,
we introduce a notion of graceful labeling of a finite poset. We obtain graceful
labeling of some postes such as a chain, a fence, and a crown. In 2002 Thakare,
Pawar, and Waphare introduced the ‘adjunct’ operation of two lattices with respect
to an adjunct pair of elements. We obtain the graceful labeling of an adjunct sum
of two chains with respect to an adjunct pair (0, 1).

References:-

References

A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (In-

ternational Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod,

Paris, (1967).

G. Gr¨atzer, General Lattice Theory, Birkhauser, Verlag, Second Edition, 1998.

J.A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Com-

binatorics, 25 (2022) 1-623. https://doi.org/10.37236/11668

N. K. Thakare, M. M. Pawar, and B. N. Waphare, A structure theorem for disman-

tlable lattices and enumeration, Periodica Mathematica Hungarica, 45 (1-2) (2002)

-160.

A. N. Bhawale and B. N. Waphare, Posets dismantlable By doubly irreducibles, Jour-

nal of the Indian Math. Soc., 88 (1-2) (2021), 46-59.

M. P. Biatch, J. S. Bagga, and S. Arumugam, A survey and a new class of graceful

unicylic graphs. AKCE International Journal of Graphs and Combinatorics, 17(2),

(2020) 673–678. https://doi.org/10.1080/09728600.2020.1832853

D. B. West, Introduction to Graph Theory, Pearson Education, Pearson, Second

Edition, 2015.

R. Sivaraman, Graceful graphs and its applications, International Journal of Current

Research, 8 (2016) 41062-41067.

S. Venkatesh and K. Balasubramanian, Some results on generating graceful

trees, International Journal of Engineering and Technology 7(4) (2018) 570-572,

https://doi.org/10.14419/ijet.v7i4.10.21283.

G. Ringel, Theory of graphs and its applications, In Proceedings of the Symposium

Smolenice (1963).

D. Kelly and I. Rival, Crowns, fences, and dismantlable lattices, Can. J. Math., 27

(1974) 1257-1271.

P. Ragukumar, and G. Sethuraman, Binomial trees are graceful, AKCE In-

ternational Journal of Graphs and Combinatorics, 17(1) (2020) 632–636.

https://doi.org/10.1016/j.akcej.2018.06.005

Downloads

Citation Tools

How to Cite
Bhavale, D. A., & Shelke, D. (2025). Graceful labeling of posets. International Journal Of Mathematics And Computer Research, 13(2), 4864-4877. https://doi.org/10.47191/ijmcr/v13i02.11