Super Edge-antimagic Total Labeling of Disjoint Union of Triangular Ladder and Lobster Graphs

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

Title:	Super Edge-antimagic Total Labeling of Disjoint Union of Triangular Ladder and Lobster Graphs
Authors:	Dafik, Slamin, M Fuad, Riris R.R
Keywords:	a, d-edge-antimagic total labeling, super a, d-edge-antimagic total labeling, triangular ladder, lobster graph
Issue Date:	12-Oct-2009
Publisher:	Indoms Indonesian Mathematics Society
Series/Report no.:	IICMA (Indoms International Conference on Mathematics and Its Applications);2009
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 super (a, d)-edge-antimagic total properties of disconnected graphs triangular ladder and lobster.
Description:	YEAR/VOLUME/NUMBER/PAGE:2009/October 12-13/48
URI:	http://repository.unej.ac.id/handle/123456789/58934
ISSN:	Proceeding (ISBN 978-602-96426-0-5)
Appears in Collections:	MIPA

Files in This Item:

File	Description	Size	Format
4Super Edge-Antimagic Total Labeling of Disjoint Union of Triangular Ladder and Lobster Graphs OKOK.pdf		2.69 MB	Adobe PDF	View/Open

DSpace JSPUI