Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/86171
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSanti, Risan Nur-
dc.contributor.authorAgustin, Ika Hesti-
dc.contributor.authorDafik, Dafik-
dc.contributor.authorAlfarisi, Ridho-
dc.date.accessioned2018-07-04T06:18:08Z-
dc.date.available2018-07-04T06:18:08Z-
dc.date.issued2018-07-04-
dc.identifier.issn1742-6588-
dc.identifier.urihttp://repository.unej.ac.id/handle/123456789/86171-
dc.descriptionIOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)en_US
dc.description.abstractLet G =(V (G),E(G) be a connected graph and v V (G). A dominating set for a graph G =(V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G. Vertex set S in graph G =(V, E) is a locating dominating set if for each pair of distinct vertices u and v in V (G) − S we have N(u) ∩ S = φ, N(v) ∩ S = φ,andN(u) ∩ S = N(v) ∩ S, that is each vertex outside of S is adjacent to a distinct, nonempty subset of the elements of S. In this paper, we characterize the locating dominating sets in the corona product of graphs namely path, cycle, star, wheel, and fan graph.en_US
dc.language.isoenen_US
dc.subjectLocating dominating setsen_US
dc.subjectdominating setsen_US
dc.subjectocating dominating numberen_US
dc.subjectcorona producten_US
dc.titleOn the locating domination number of corona producten_US
dc.typeArticleen_US
Appears in Collections:LSP-Jurnal Ilmiah Dosen

Files in This Item:
File Description SizeFormat 
F. MIPA_Jurnal_Ika Hesti_On the locating domination.pdf1.02 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.