# Super (a,d)-$H$- antimagic total covering of connected amalgamation of fan graph

## DSpace/Manakin Repository

 dc.contributor.author Siti Latifah, Ika Hesti A., Dafik dc.date.accessioned 2016-02-18T08:53:01Z dc.date.available 2016-02-18T08:53:01Z dc.date.issued 2016-02-18 dc.identifier.uri http://repository.unej.ac.id/handle/123456789/73334 dc.description.abstract Graph $G=(V,E)$ is a finite, simple and undirected. en_US Graph $G$ have $H'$ covering, if every edge in $E(G)$ belongs to at least one subgraph of $G$ isomorphic to a given graph $H$. A graph $G$ is said to be an $(a, d)$-$H$-antimagic total covering if there exist a bijective function $f: V(G) \cup E(G) \rightarrow \{1, 2,\dots ,|V (G)| + |E(G)|\}$ such that for all subgraphs $H'$ isomorphic to $H$, the total $H$-weights $w(H)= \sum_{v\in V(H')}f(v)+\sum_{e\in E(H')}f(v)$ form an arithmetic sequence $\{a, a + d, a +2d,...,a+(s - 1)d\}$, where $a$ and $d$ are positive integers and $s$ is the number of all subgraphs $H'$ isomorphic to $H$. Such a covering is called super if $f: V(G) \rightarrow \{1, 2,\dots ,|V (G)|\}$. This paper will study the existence of super $(a, d)-H$- antimagic total covering of connected amalgamation of fan graph for feasible $d$. dc.description.sponsorship CGANT UNEJ en_US dc.language.iso id en_US dc.relation.ispartofseries Semnas Mat dan Pembelajaran;5/11/2015 dc.subject Super $H$-antimagic total, amalgamation fan graph. en_US dc.title Super (a,d)-$H$- antimagic total covering of connected amalgamation of fan graph en_US dc.type Working Paper en_US
﻿