Super Edge-Antimagicness for a Class of Disconnected Graphs

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

Title:	Super Edge-Antimagicness for a Class of Disconnected Graphs
Authors:	DAFIK M Mirka, J Ryan, M Baca
Keywords:	A D-EDGE-ANTIMAGIC TOTAL LABELING SUPER A D-EDGE-ANTIMAGIC TOTAL LABELING DISCONNECTED GRAPSH STAR GRAPHS.
Issue Date:	13-Jul-2006
Publisher:	CIAO (Center for Informatics and Applied Optimisation), ITMS (School of Information Technology and Mathematical Science), University of Ballarat Australia.
Series/Report no.:	The Seventeenth Australian Workshop on Combinatorial Algorithms;17
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, ...., 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 properties of super (a, d)-edge-antimagic total labeling of disconnected graphs K_{1,m} U K_{1,n}.
Description:	YEAR/VOLUME/NUMBER/PAGE:2006/Juli 13-19/67-75
URI:	http://repository.unej.ac.id/handle/123456789/58932
ISSN:	Proceeding
Appears in Collections:	MIPA

Files in This Item:

File	Description	Size	Format
2Super edge-antimagicness for a class of disconnected graphs OKOK.pdf		1.84 MB	Adobe PDF	View/Open

DSpace JSPUI