On Domination in Graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2005 English Publisher:University of Zielona Góra, PolandJournal:Discussiones Mathematicae Graph Theory, volume 25, page 7 (issn: 1234-3099, eissn: 2083-5892,

Copyright policy )

Authors: Frank Göring; Jochen Harant;

doi: 10.7151/dmgt.1254

On Domination in Graphs

- Summary
- Subjects
- Metrics

Abstract

Summary: 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 \(\gamma\) of \(G\). An efficient approximation method is developed and known upper bounds on \(\gamma\) are slightly improved.

Related Organizations

Chemnitz University of Technology
Germany
Ilmenau University of Technology
Germany

Keywords

optimization problems, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), approximation method

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

1

Average

Published in a Diamond OA journal

Fields of Science (3) View all

Fields of Science