Bilangan Invers Dominasi Total Pada Triangular Snake Graph, Line Triangular Snake Graph, dan Shadow Triangular Snake Graph

Let G = (V(G), E(G)) be a connected graph, where V(G) is the set of vertices and E(G) is the set of edges. The set Dt(G) is called the total domination set in G if every vertex v 2 V(G) is adjacent to at least one vertex in Dt (G). Furthermore, Dt(G) must satisfy the property N(Dt ) = V(G), where N(...

Full description

Bibliographic Details

Published in:	Jambura Journal of Mathematics
Main Authors:	Nurhamzah Nurhamzah, Nilamsari Kusumastuti, Fransiskus Fran
Format:	Article
Language:	English
Published:	Department of Mathematics, Universitas Negeri Gorontalo 2022-06-01
Subjects:	total domination number inverse total domination open neighborhood
Online Access:	https://ejurnal.ung.ac.id/index.php/jjom/article/view/14176