Volume 52 | Number 2 | Year 2017 | Article Id. IJMTT-V52P516 | DOI : https://doi.org/10.14445/22315373/IJMTT-V52P516
Satheesh E.N, J. Suresh Kumar, "Roman Labeling of graphs and Application to Military Strategy," International Journal of Mathematics Trends and Technology (IJMTT), vol. 52, no. 2, pp. 120-122, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V52P516
In this paper, we introduce a new type of graph labeling called Roman labeling and a graph parameter called Roman number. Its properties are studied and its values for special types of graphs are explored.
[1] J. R. Lewis, Vertex - Edge and Edge - Vertex Parameters in Graphs, Ph.D. Thesis submitted to the Graduate School of Clemson University.
[2] D. Ochmanek, Time to restructure U.S defence force, ISSUES in Scienceand Technology, Winter 1996.
[3] A. Pagourtzis, P. Penna, K. Schlude, K. Steinhofel, D. S. Tailor and P.Windmayer, “Server placements, Roman domination and other dominating set variants”, 2nd IFIP International conference on theoretical Computer Science, Montreal (2002), 280 - 291.
[4] Windmayer, Server placements, Roman domination and other dominating set variants, 2nd IFIP International conference on theoretical Computer Science, Montreal (2002), 280 - 291.
[5] I. Petersen, Defending Roman empire, MathTreck, September 11 (2000),www.maa.org.
[6] J. Gallian, A dynamic survey on graph labeling, the electronic journal of combinatorics (2016), #DS62017.
[7] Frank Harary, Graph Theory, Reading mass, 1969.