CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS

On the Domination Number of Some Graph Operations

N Y. Sari (Unknown)
I H. Agustin (Unknown)
Dafik Dafik (Unknown)

Article Info

Publish Date
02 Jun 2020

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,

Copyrights © 2020




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
823.596 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Website

Abbrev

cgant

Publisher

Universitas Jember

Subject

Computer Science & IT Other

Description

Subjects suitable for publication include, the following fields of: Degree Diameter Problem in Graph Theory Large Graphs in Computer Science Mathematical Computation of Graph Theory Graph Coloring in Atomic and Molecular Graph Labeling in Coding Theory and Cryptography Dimensions of graphs on ...