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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Hikari Ltd
2008
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/15916/ http://psasir.upm.edu.my/id/eprint/15916/1/on%20the%20domination%20number.pdf |
| _version_ | 1848842813897179136 |
|---|---|
| author | Alikhani, Saeid Peng, Yee Hock Mohd Atan, Kamel Ariffin |
| author_facet | Alikhani, Saeid Peng, Yee Hock Mohd Atan, Kamel Ariffin |
| author_sort | Alikhani, Saeid |
| building | UPM Institutional Repository |
| collection | Online Access |
| 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. |
| first_indexed | 2025-11-15T08:05:06Z |
| format | Article |
| id | upm-15916 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T08:05:06Z |
| publishDate | 2008 |
| publisher | Hikari Ltd |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-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 |
| spellingShingle | Alikhani, Saeid Peng, Yee Hock Mohd Atan, Kamel Ariffin On the domination number of some graphs. |
| title | 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_short | On the domination number of some graphs. |
| title_sort | on the domination number of some graphs. |
| url | http://psasir.upm.edu.my/id/eprint/15916/ http://psasir.upm.edu.my/id/eprint/15916/1/on%20the%20domination%20number.pdf |