Download PDF - On domination in graphs
ArticleOriginal scientific text
Title
On domination in graphs
Authors 1, 2
Affiliations
- Department of Mathematics, Chemnitz University of Technology, D-09107 Chemnitz, Germany
- Department of Mathematics, Technical University of Ilmenau, D-98684 Ilmenau, Germany
Abstract
For a finite undirected graph G on n vertices two continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the domination number γ of G. An efficient approximation method is developed and known upper bounds on γ are slightly improved.
Keywords
graph, domination
Bibliography
- Y. Caro, New results on the independence number (Technical Report, Tel-Aviv University, 1979).
- Y. Caro and Zs. Tuza, Improved lower bounds on k-independence, J. Graph Theory 15 (1991) 99-107, doi: 10.1002/jgt.3190150110.
- R. Diestel, Graph Theory, Graduate Texts in Mathematics (Springer, 1997).
- N. Alon, J.H. Spencer and P. Erdös, The Probabilistic Method (John Wiley and Sons, Inc. 1992), page 6.
- M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness (W.H. Freeman and Company, San Francisco, 1979).
- J. Harant, Some news about the independence number of a graph, Discuss. Math. Graph Theory 20 (2000) 71-79, doi: 10.7151/dmgt.1107.
- J. Harant, A. Pruchnewski and M. Voigt, On dominating sets and independent sets of graphs, Combinatorics, Probability and Computing 8 (1999) 547-553, doi: 10.1017/S0963548399004034.
- T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, Inc., New York, N.Y., 1998), page 52.
- V.K. Wei, A lower bound on the stability number of a simple graph (Bell Laboratories Technical Memorandum 81-11217-9, Murray Hill, NJ, 1981).
Pages:
7-12
Main language of publication
English
Received
2003-09-23
Accepted
2004-06-15
Published
2005
DOI: 10.7151/dmgt.1254
Exact and natural sciences