Global Convexity Graph of a Graph
K. Karuppasamy1, S. Arumugam2
1Dr. K. Karuppasamy, Mathematics, Kalasalingam Academy of Research and Education College, Krishnankoil, Virudhunagar (Tamil Nadu), India.
2Dr. S. Arumugam, Mathematics, Kalasalingam Academy of Research and Education College, Krishnankoil, Virudhunagar (Tamil Nadu), India.
Manuscript received on 25 November 2019 | Revised Manuscript received on 19 December 2019 | Manuscript Published on 30 December 2019 | PP: 964-966 | Volume-9 Issue-1S4 December 2019 | Retrieval Number: A12031291S419/19©BEIESP | DOI: 10.35940/ijeat.A1203.1291S419
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Let G = (V, E) be a graph. A function g :V [0,1] is called a global dominating function (GDF) of G, if for every [ ] , ( ) 1 u N v v V g N v g u and ( ) ( ) 1. ( ) u N v g N v g u A GDF g of a Graph G is minimal (MGDF) if for all functions f :V [0,1] such that f g and f (v) g(v) for at least one vV, f is not a GDF. In this paper, we introduce the concept of global convexity graph and determine the global convexity graphs for some standard graphs.
Keywords: Convexity Graph, Global Convexity Graph, Global Dominating Function, Global Domination.
Scope of the Article: Cryptography and Applied Mathematics