Please use this identifier to cite or link to this item:
https://repository.unej.ac.id/xmlui/handle/123456789/72903
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Muhlisatul Mahmudah, Dafik, Slamin | - |
dc.date.accessioned | 2016-01-28T08:56:21Z | - |
dc.date.available | 2016-01-28T08:56:21Z | - |
dc.date.issued | 2016-01-28 | - |
dc.identifier.uri | http://repository.unej.ac.id/handle/123456789/72903 | - |
dc.description.abstract | A graph $G$ of order $p$ and size $q$ is called an {\it $(a,d)$-edge-antimagic total} if there exist a bijection $f : V(G)\cup E(G) \to \{1,2,\dots,p+q\}$ such that the edge-weights, $w(uv)=f(u)+f(v)+f(uv), uv \in E(G)$, form an arithmetic sequence with first term $a$ and common difference $d$. Such a graph $G$ is called {\it super} if the smallest possible labels appear on the vertices. In this paper we will study the exsistence of super (a,d)-edge antimagic total labeling of shackle of fan, denoted by $ {\rm shack}(F_6,c_4^1,n)$, and the application of developing of polyalphabetic cryptosystem. The result shows that connected shackle of fan admits a super $(a,d)$-edge antimagic total labeling for $d=0,1,2$, and it can be used to develop a secure polyalphabetic cryptosystem. | en_US |
dc.description.sponsorship | CGANT UNEJ | en_US |
dc.language.iso | id | en_US |
dc.subject | super (a,d)-edge-antimagic total labeling, shackle, fan graph polyalphabetic cryptosystem. | en_US |
dc.title | Super Edge Antimagic Total pada Generalisasi Shackle Graf Kipas dan Aplikasinya dalam Pengembangan Cryptosystem | en_US |
dc.type | Working Paper | en_US |
Appears in Collections: | MIPA |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Muhlisatul Kombinasi.pdf | 177.79 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.