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: | Gembong A.W (Author), Slamin, Slamin (Author), Dafik, Dafik (Author), Agustin, Ika Hesti (Author) |
---|---|
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!
|
Similar Items
-
On Rainbow k-Connection Number of Special Graphs and It's Sharp Lower Bound
by: Agustin, Ika Hesti, et al.
Published: (2018) -
The geodetic domination number of comb product graphs
by: Fahrudin, Dimas Agus; Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia, et al.
Published: (2020) -
Resolving Domination Number of Graphs
by: ALFARISI, Ridho, et al.
Published: (2020) -
On the distance domination number of bipartite graphs
by: Mojdeh, Doost Ali; Department of Mathematics, University of Mazandaran, Babolsar, Iran, et al.
Published: (2020) -
ON DISTANCE IRREGULAR LABELLING OF GRAPHS
by: Slamin, Slamin
Published: (2017)