On the domination number of a graph

Authors:
Anja Pruchnewski
Affiliations:
Institut fur Mathematik, Technische Universitat Ilmenau, Postfach 100565, 98684 Ilmenau, Germany
Venue:
Discrete Mathematics
Year:
2002

Citing 9
Cited 2

n-Domination in graphs

Graph theory with applications to algorithms and computer science
Improved lower bounds on k-independence

Journal of Graph Theory
On graphs with equal domination and covering numbers

2nd Twente workshop on Graphs and combinatorial optimization
On equality in an upper bound for domination parameters of graphs

Journal of Graph Theory
Bounds related to domination in graphs with minimum degree two

Journal of Graph Theory
Parallel algorithms for the domination problems in trapezoid graphs

Discrete Applied Mathematics
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On Dominating Sets and Independent Sets of Graphs

Combinatorics, Probability and Computing

2-rainbow domination of generalized Petersen graphs P(n,2)

Discrete Applied Mathematics
Note: 2-rainbow domination in generalized Petersen graphs P(n,3)

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

For a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the domination number γ(G) of G.