Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Siti Aminatus Solehah
Unknown Affiliation
Computer Science & IT Other

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

Found 1 Documents
Search

 1 
Independent Domination Number of Operation Graph Siti Aminatus Solehah; Ika Hesti 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 (976.66 KB) | DOI: 10.25037/cgantjma.v1i1.6

Abstract

Let G be a simple, undirected and connected graph. An independent set or stable set is a set of vertices in a graph in which no two of vertices are adjacent. A set D of vertices of graph G is called a dominating set if every vertex u ∈ V (G) − D is adjacent to some vertex v ∈ D. A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. A minimum independent dominating set is an independent set of smallest possible size for a given graph G. This size is called the independence number of G, and denoted i(G). Operation Graph is a technical to get a new graph types by performing the operation of two or more graphs. Power Graph is a operation graph where let the graph G and H , notation of the power graph is (GH ). Keywords: r-dynamic coloring, r-dynamic chromatic number, graph operations. 
Co-Authors D. Dafik Ika Hesti Agustin, Ika Hesti