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!
|
| id |
my.upm.eprints.15916 |
|---|---|
| record_format |
eprints |
| spelling |
my.upm.eprints.159162015-12-04T03:51:28Z http://psasir.upm.edu.my/id/eprint/15916/ On the domination number of some graphs. Alikhani, Saeid Peng, Yee Hock Mohd Atan, Kamel Ariffin 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 paper, as an application of this inequality, we obtain the domination number of some certain graphs. Hikari Ltd 2008 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/15916/1/on%20the%20domination%20number.pdf Alikhani, Saeid and Peng, Yee Hock and Mohd Atan, Kamel Ariffin (2008) On the domination number of some graphs. International Mathematical Forum, 3 (38). pp. 1879-1884. ISSN 1312-7594 English |
| institution |
Universiti Putra Malaysia |
| building |
UPM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Putra Malaysia |
| content_source |
UPM Institutional Repository |
| url_provider |
http://psasir.upm.edu.my/ |
| language |
English English |
| description |
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 paper, as an application of this inequality, we obtain the domination number of some certain graphs. |
| format |
Article |
| author |
Alikhani, Saeid Peng, Yee Hock Mohd Atan, Kamel Ariffin |
| spellingShingle |
Alikhani, Saeid Peng, Yee Hock Mohd Atan, Kamel Ariffin On the domination number of some graphs. |
| author_facet |
Alikhani, Saeid Peng, Yee Hock Mohd Atan, Kamel Ariffin |
| author_sort |
Alikhani, Saeid |
| title |
On the domination number of some graphs. |
| title_short |
On the domination number of some graphs. |
| title_full |
On the domination number of some graphs. |
| title_fullStr |
On the domination number of some graphs. |
| title_full_unstemmed |
On the domination number of some graphs. |
| title_sort |
on the domination number of some graphs. |
| publisher |
Hikari Ltd |
| publishDate |
2008 |
| url |
http://psasir.upm.edu.my/id/eprint/15916/1/on%20the%20domination%20number.pdf http://psasir.upm.edu.my/id/eprint/15916/ |
| _version_ |
1643826066614124544 |
| score |
13.214268 |