N Y. Sari
Unknown Affiliation

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

On the Domination Number of Some Graph Operations N Y. Sari; I H. Agustin; Dafik Dafik
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (823.596 KB) | DOI: 10.25037/cgantjma.v1i1.4

Abstract

A 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 ∈ V (G) − D is adja-cent to some vertex v ∈ D. The domination number of a graph G, denoted by γ(G), is the order of a smallest dominating set of G. A dominating set D with |D| = γ(G) is called a minimum dominating set. This research aims to char-acterize 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 γ(G). Keywords: Dominating set, domination number,