PELABELAN GRACEFUL PADA GRAF SIPUT DAN GRAF UBUR-UBUR
Keywords:
pelabelan graceful, graf graceful, graf siput, graf ubur-ubur
Downloads
Download data is not yet available.
References
[1] S. Arumugam and J. Bagga, “Graceful labeling algorithm and complexity–a survey,” Indones. Math. Soc., Special Edition, 1–9 (2011).
[2] G. Chartrand, C. Egan, and P. Zhang, How to Label a Graph, Springer, New York (2019).
[3] J. A. Gallian, “A Dynamic Survey of Graph Labelling,” Elect. J. Combin., 1–553 (2020).
[4] S. W. Golomb, How to Number a Graph, Academic Press, New York, 23–37 (1972).
[5] J. M. Manulang and K. A. Sugeng, “Graceful labeling on torch graph,” Indon. J. Combin., 2(1), 14–19 (2018).
[6] A. Rosa, On certain valuation of the vertices of a graph (Theory of Graph) Gordon and Breach, New York, 349–355 (1967).
[7] K. H. Rosen, Discrete Mathematics and Its Applications (8th ed.), McGraw-Hill, New York (2019).
[2] G. Chartrand, C. Egan, and P. Zhang, How to Label a Graph, Springer, New York (2019).
[3] J. A. Gallian, “A Dynamic Survey of Graph Labelling,” Elect. J. Combin., 1–553 (2020).
[4] S. W. Golomb, How to Number a Graph, Academic Press, New York, 23–37 (1972).
[5] J. M. Manulang and K. A. Sugeng, “Graceful labeling on torch graph,” Indon. J. Combin., 2(1), 14–19 (2018).
[6] A. Rosa, On certain valuation of the vertices of a graph (Theory of Graph) Gordon and Breach, New York, 349–355 (1967).
[7] K. H. Rosen, Discrete Mathematics and Its Applications (8th ed.), McGraw-Hill, New York (2019).
Published
2022-04-19
How to Cite
Akbar, K., & Sugeng, K. (2022). PELABELAN GRACEFUL PADA GRAF SIPUT DAN GRAF UBUR-UBUR. Pattimura Proceeding: Conference of Science and Technology, 2(1), 143-148. Retrieved from https://ojs3.unpatti.ac.id/index.php/pcst/article/view/5647
Issue
Section
Articles
Copyright (c) 2022 Pattimura Proceeding: Conference of Science and Technology
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
