Some Results on Relatively Prime Edge Labeled Graph
DOI:
https://doi.org/10.26713/cma.v14i5.2154Keywords:
Prime graph, Coprime graph, Relatively prime edge labeled graph, Relatively prime indexAbstract
Prime labeling and relatively prime edge labeling have the same idea for labeling the general graph \(G\). Prime labeling labels the vertices of the general graph in such a way that adjacent vertices receive relatively prime labels. Similarly, relatively prime edge labeling, labels the edges in a way that the adjacent edges have relatively prime labels. Also, there are graphs that do not have relatively prime edge labeling. Hence the concept of relatively prime index is introduced, which finds the minimum number of edges to be removed from \(G\) to make it a relatively prime edge labeled graph. The main purpose of the current study is to discuss some results on the topic of relatively prime edge labeled graphs and relatively prime index.
Downloads
References
J. Asplund and N. B. Fox, Minimum coprime labelings for operations on graphs, Integers 19 (2019), Article number: A24, 26 pages, URL: http://math.colgate.edu/~integers/vol19.html.
H.-L. Fu and K.-C. Huang, On prime labellings, Discrete Mathematics 127(1-3) (1994), 181 – 186, DOI: 10.1016/0012-365X(92)00477-9.
J. A. Gallian, A dynamic survey of graph labelling (Graph labelling), The Electronic Journal of Combinatorics DS6 (Version 25) (2022), 623 pages, DOI: 10.37236/27.
R. Jagadesh and J. B. Babujee, On edge vertex prime labeling, International Journal of Pure and Applied Mathematics 114(6) (2017), 209 – 218, URL: https://acadpubl.eu/jsi/2017-114-5/issue2.html.
R. Janani and T. Ramachandran, On relatively prime edge labeling of graphs, Engineering Letters 30(2) (2022), 659 – 665, URL: https://www.engineeringletters.com/issues_v30/issue_2/EL_30_2_30.pdf.
A. V. Kanetkar, Prime labeling of grids, AKCE International Journal of Graphs and Combinatorics 6(1) (2009), 135 – 142, URL: https://www.tandfonline.com/doi/abs/10.1080/09728600.2009.12088880.
G. C. Lau and W. C. Shiu, On SD-prime labeling of graphs, Utilitas Mathematica 106 (2018), 149 – 164, URL: https://utilitasmathematica.com/index.php/Index/article/view/1344.
M. H. B. A. Mostafa and E. Ghorbani, Hamiltonicity of a coprime graph, Graphs and Combinatorics 37(6) (2021), 2387 – 2395, DOI: 10.1007/s00373-021-02362-1.
A. Rosa, On certain valuations of the vertices of a graph, in: Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, N.Y. and Dunod, Paris (1967), pp. 349 – 355.
W.-C. Shiua, G.-C. Laub and S.-M. Leec, On (semi-) edge-primality of graphs, Iranian Journal of Mathematical Sciences and Informatics 12(2) (2017), 1 – 14, DOI: 10.7508/ijmsi.2017.2.001.
A. Tout, A. N. Dabboucy and K. Howalla, Prime labeling of graphs, National Academy Science Letters 11 (1982), 365 – 368.
S. K. Vaidya and U. M. Prajapati, Some results on prime and k-prime labeling, Journal of Mathematics Research 3(1) (2011), 66 – 75, DOI: 10.5539/jmr.v3n1p66.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
