GLOBAL DISTRIBUTION CENTER NUMBER OF SOME GRAPHS AND AN ALGORITHM

摘要

The global center is a newly proposed graph concept. For a graph G = (V(G), E(G)), a set S subset of V(G) is a global distribution center if every vertex v is an element of V(G)S is adjacent to a vertex u is an element of S with |N[u] boolean AND S| >= |N[v] boolean AND (V(G)S)|, where N(v) = {u is an element of V(G)|uv is an element of E(G)} and N[v] = N(v) ? {v}. The global distribution center number of a graph G is the minimum cardinality of a global distribution center of G. In this paper, we investigate the global distribution center number for special families of graphs. Furthermore, we develop a polynomial time heuristic algorithm to find the set of the global distribution center for general graphs.