On the domination number of some graphs.
Let G = (V,E) be a simple graph. A set S ⊆ V is a dominating set of graph G, if every vertex in V − S is adjacent to at least one vertex in S. The domination number γ(G) is the minimum cardinality of a dominating set in G. It is well known that if e ∈ E(G), then γ(G−e)−1 ≤ γ(G) ≤ γ(G−e). In this pap...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Hikari Ltd
2008
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/15916/1/on%20the%20domination%20number.pdf http://psasir.upm.edu.my/id/eprint/15916/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|