Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/73191
Full metadata record
DC FieldValueLanguage
dc.contributor.authorN.Y. Sari, I.H. Agustin, Dafik-
dc.date.accessioned2016-02-02T06:37:44Z-
dc.date.available2016-02-02T06:37:44Z-
dc.date.issued2016-02-02-
dc.identifier.urihttp://repository.unej.ac.id/handle/123456789/73191-
dc.description.abstractA set $D$ of vertices of a simple graph $G$, that is a graph without loops and multiple edges, is called a dominating set if every vertex $u\in V(G)-D$ is adjacent to some vertex $v\in D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the order of a smallest dominating set of $G$. A dominating set $D$ with $|D|=\gamma(G)$ is called a minimum dominating set. This research aims to characterize the domination number of some graph operations, namely joint graphs, coronation of graphs, graph compositions, tensor product of two graphs, and graph amalgamation. The results shows that most of the resulting domination numbers attain the given lower bound of $\gamma(G)$.en_US
dc.description.sponsorshipCGANT UNEJen_US
dc.language.isoiden_US
dc.subjectDominating set, domination number, graph operations.en_US
dc.titleOn the Domination Number of Some Graph Operationsen_US
dc.typeWorking Paperen_US
Appears in Collections:LSP-Jurnal Ilmiah Dosen

Files in This Item:
File Description SizeFormat 
nurma kombinasi.pdf140.36 kBAdobe PDFView/Open


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