Octagonal prime graceful labeling
DOI:
https://doi.org/10.23755/rm.v51i0.1312Keywords:
Octagonal numbers, Octagonal graceful labeling, Octagonal graceful graph, Octagonal prime graceful labelingAbstract
Let G be a graph with p vertices and q edges. Define a bijection f : V (G) → {1, 8, ..., p(3p - 2)} by f(vi) = i(3i - 2) for every i from 1 to p and define a 1 - 1 mapping fopgl ∗ : E(G) → set of natural number N such that f∗(uv) = |f(u) - f(v)| for all edges (uv) ∈ E(G).The induced function f is said to be octagonal prime graceful labeling if the gcin of each vertex of degree atleast 2 is one.
References
Rosa, A., "On certain valuation of the vertices of the graph," in Theory of Graphs (International Symposium, Rome, July 1963), (1964), 349-355.
Daoud, Salama Nagy, "Edge Even Graceful Labeling of Polar Grid Graphs," Symmetry, 11(38), 2019.
Elsonbaty, Amr and Daoud, Salama Nagy, "Edge Even Graceful Labeling of Some Path and Cycle Related Graphs," Ars Combinatoria, 130, 79–96, 2017.
Kani, C. and Asha, S., "4-Square Sum E-Cordial Labeling for Some Graphs," Mathematical Statistician and Engineering Applications, 71(4), 1475–1480, 2022.
Lina, S. Selestin and Asha, "On Sequential Graphs," Bulletin of Pure & Applied Sciences-Mathematics and Statistics, 37(1), 54–62, 2018.
Lina, S. Selestin and Asha, "Odd Triangular Graceful Labeling on Simple Graphs," Malaya Journal of Matematik, 8(4), 1574–1576, 2020.
Mahendran, S., "Octagonal Graceful Labeling of Some Special Graphs," World Scientific News, 156, 2021.
Murugesan, S., Jayaraman, D., and Shiama, J., "Tetrahedral and Pentatopic Sum Labeling of Graphs," International Journal of Applied Information Systems, 5, 31–35, 2013.
Meena, S. and Vaithilingam, K., "Prime Labeling for Some Fan Related Graphs," International Journal of Engineering Research & Technology (IJERT), 1(9), 2012.
Sivasakthi, S., Meena M., Renugha M., "Cordial Labeling for Different Types of Shell Graph," International Journal of Scientific & Engineering Research, 6, 2015.
Sunoj, BS, and Varkey, Mathew TK, "Hexagonal Difference Prime Labeling of Some Path Graphs," Mapana Journal of Sciences, 16, 41, 2017.
Golomb, S. W., "How to Number a Graph," in Graph Theory and Computing (edited by R. C. Read), Academic Press, New York, (1972), 23-37.
Tharmaraj, T., and Sarasija, PB, "Square Graceful Graphs," International Journal of Mathematics and Soft Computing, 4, 129-137, 2014.
Wahyuna, Hafidhyah Dwi and Indriati, Diari, "On the Total Edge Irregularity Strength of Generalized Butterfly Graph," Journal of Physics: Conference Series, 1008, 012027, 2018.
Zeen El Deen, Mohamed R., "Edge δ-Graceful Labeling for Some Cyclic-Related Graphs," Advances in Mathematical Physics, 2020, 1–18, 2020.
Downloads
Published
Issue
Section
License
This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:
- Free access for all users worldwide
- Increased visibility and readership
- Rapid publication
- No spatial constraints
- Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)
Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified.
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.
