Bound of Distance Domination Number of Graph and Edge Comb Product Graph
IOP Conf. Series: Journal of Physics: Conf. Series 855 (2017)
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Academic Paper |
| Published: |
2017-09-11T03:38:16Z.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 01523 am a22002413u 4500 | ||
|---|---|---|---|
| 001 | repository_unej_123456789_81678 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Gembong A.W |e author |
| 500 | |a http://repository.unej.ac.id/handle/123456789/81678 | ||
| 700 | 1 | 0 | |a Slamin, Slamin |e author |
| 700 | 1 | 0 | |a Dafik, Dafik |e author |
| 700 | 1 | 0 | |a Agustin, Ika Hesti |e author |
| 245 | 0 | 0 | |a Bound of Distance Domination Number of Graph and Edge Comb Product Graph |
| 260 | |c 2017-09-11T03:38:16Z. | ||
| 520 | |a IOP Conf. Series: Journal of Physics: Conf. Series 855 (2017) | ||
| 520 | |a Let G =(V, E) be a simple, nontrivial, finite, connected and undirected graph. For an integer 1 k diam(G), a distance k-dominating set of a connected graph G is a set S of vertices of G such that every vertex of V (G)\S is at distance at most k from some vertex of S. The k-domination number, denoted by γ (G), of G is the minimum cardinality of a k-dominating set of G. In this paper, we improve the lower bound on the distance domination number of G regarding to the diameter and minimum degree as well as the upper bound regarding to the order and minimum k distance neighbourhood. In addition, we determine the bound of distance domination number of edge comb product graph. | ||
| 546 | |a en | ||
| 690 | |a distance domination | ||
| 690 | |a diameter | ||
| 690 | |a edge comb product graph | ||
| 655 | 7 | |a Article |2 local | |
| 787 | 0 | |n http://repository.unej.ac.id/handle/123456789/81678 | |
| 856 | 4 | 1 | |u http://repository.unej.ac.id/handle/123456789/81678 |z Get Fulltext |