243
Views
0
CrossRef citations to date
0
Altmetric
Articles

Encrypting and decrypting algorithms using strong face graph of a tree

, & ORCID Icon
Pages 225-233 | Received 19 Mar 2020, Accepted 30 Jul 2020, Published online: 24 Aug 2020

References

  • M.A. Ahmed and J. Baskar Babujee, On face antimagic labeling of strong face plane graphs, Appl. Math. Sci. 11(2) (2017), pp. 77–91.
  • M. Baca, Face antimagic labeling of convex polytopes, Utilitas Math. 55 (1999), pp. 221–226.
  • J.A. Gallian, A dynamic survey of graph labeling, Electronic J. Comb. 5 (1998) (2019).
  • A. Rosa, On certain valuations of the vertices of a graph, in Theory of Graphs (Internat. Symposium, Rome, July 1966), Gordon and Breach, New York and Dunod, Paris, 1967, pp. 349–355.
  • S.K. Vaidya and U.M. Prajapati, Prime labeling in the context of duplication of graph elements, Int. J. Math. Soft Comput. 3 (2013), pp. 13–20. doi: 10.26708/IJMSC.2013.1.3.01

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.