ESTD PERPUSTAKAAN UNTAD
ESTD PERPUSTAKAAN UNTAD
| JudulPELABELAN SELIMUT BINTANG AJAIB SUPER PADA GRAF BINTANG |
| Nama: NURAENI B DG MATTIRO |
| Tahun: 2021 |
| Abstrak Let G = (V,E) be a simple graph. An edge covering of G is a family of subgraphs H_1,…,H_k such that each edge of graph E (G) belongs to at least one of the H_i, 1?i?k subgraphs. If each H_i is isomorphic with the given graph H, then it is said that G contains aH- covering. The graph G contains a covering H and f the bijectif function f: V (G) ?E (G) ? (1,2,3,…,| V (G) | + | E (G) |) is said an the H-magic labeling of a graph G if for each subgraph H ^ '= (V',E') of G is isomorphic to H, so that ?_(v?V(H^'))??f(V)+?_(e?E(H^'))??f(E) ?? is a constant. It is said that the graph G has a H-super magic if f (V (G)) = {1,2,3,…,| V (G) |} in this case, the graph G which can be labeled with H- magic is called the covering graph H- magic. A star graph with n points is a graph with n points and n-1 sides, where 1 point is n-1 degree and the other n-1 point has degree 1 denoted by S_n. This study aims to determine the presence of covering labeling for the S_3-super-magic star on the S_n star graph. The research methodology is literature study. The results show that the S_n star graph for n?4 has S_3- magic covering labeling with magic constants for all covering is 6n-3 and the S_3- super-magic covering labeling with magic constants for all covering is 4n + 3. Keywords : Covering H-Magic, Covering H-Super Magic, Star Graph |