Open AccessGlobal Convexity Graph of a Graph
Author(s) -
K. Karuppasamy,
S. Arumugam
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.a1203.1291s419
Subject(s) - convexity , combinatorics , graph , mathematics , discrete mathematics , economics , financial economics
(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