Keywords:-

Keywords: Graph, algorithm, dominating set, central structures.

Article Content:-

Abstract

In this paper we consider a strong center location problem, which is based on the dominating set problem. The computation of the minimum dominating sets of a graph is used as a basic step for the determination of strong centers of the graph. The strong centers are developed from strong domination sets. We first
study reachable sets, link vectors of the vertices and then introduce two binary operations  and  for finding the dominating sets. These are used as tools for designing an algorithm to find the strong centers. We investigate the dominating sets of a graph. Some required results for developing algorithms are also proved. Using these concepts we present an algorithm to find all strong centers of a graph.

References:-

References

B. D. Acharya, H. B. Walikar and E.

Sampathkumar, Recent developments in the

theory of

domination in graphs, Mehta Research Institute,

Allahabad, MRI Lecture notes in

Math.1(1979).

A. Anto Kinsley and S. Somasundaram, A

domination based algorithm to k-center problem,

Journal of Discrete Mathematical Sciences and

Cryptography, Vol.9, No.3,(2006),403-416.

F. Buckley and F. Harary, Distance in Graphs,

Addison-Wesley Publishing Company,

New York, (1990).

N. Christofides, Graph Theory an algorithmic

approach, Academic Press, London, (1975).

P. J. Slater, Maximin facility location, J. Res.

Net Burstandards, 79B, (1975), 107- 115.

H. S. Wilf, Algorithms and Complexity,

Prentice – Hall International, Inc., U. S. A.

(1986).

Downloads

Citation Tools

How to Cite
Kinsley, A. A., & Somasundaram, S. (2013). Domination Based Algorithms to Strong Centers of A Graph. International Journal Of Mathematics And Computer Research, 1(08), 204-208. Retrieved from https://ijmcr.in/index.php/ijmcr/article/view/218