Super Antimagicness of a Well-defined Graph

Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/58935

Full metadata record

DC Field	Value	Language
dc.contributor.author	Dafik, Alfin Fajriatin, Kunti Miladiyah F	-
dc.date.accessioned	2014-08-17T02:22:39Z	-
dc.date.available	2014-08-17T02:22:39Z	-
dc.date.issued	2012-06-01	-
dc.identifier.issn	JOURNAL (ISSN 1411-5433)	-
dc.identifier.uri	http://repository.unej.ac.id/handle/123456789/58935	-
dc.description.abstract	A graph G of order p and size q is called an (a, d)-edge- antimagic total if there exist a bijection f : V (G)U E(G) ---> {1,2,3,4,5,...., 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 super if the smallest possible labels appear on the vertices. In this paper we study super (a, d)-edge-antimagic total properties of connected and disconnected of a well-defined mountain graph and also show a new concept of a permutation of an arithmetic sequence.	en_US
dc.description.sponsorship	DP2M DIKTI 2012	en_US
dc.language.iso	en	en_US
dc.publisher	PMIPA FKIP Universitas Jember	en_US
dc.relation.ispartofseries	SAINTIFIKA;14 (1)	-
dc.subject	SEATL, Permutation, Arithmetic Sequence, Mountain Graph	en_US
dc.title	Super Antimagicness of a Well-defined Graph	en_US
dc.type	Article	en_US
Appears in Collections:	MIPA

Files in This Item:

File	Description	Size	Format
5Super Antimagicness of A Well-defined Graphv OKOK.pdf		1.33 MB	Adobe PDF	View/Open

DSpace JSPUI