Construction for antimagic generalized web graphs

Title: Construction for antimagic generalized web graphs
Creator: Rylands, Leanne; Phanalasy, Oudone; Ryan, Joe; Miller, Mirka
Relation: AKCE International Journal of Graphs and Combinatorics Vol. 8, Issue 2, p. 141-149
Relation: http://www.akcejournal.org/contents/vol8no2/vol8_no2_4.htm
Publisher: Kasalingam University
Resource Type: journal article
Date: 2011
Description: An antimagic labeling of a graph with q edges is a bijection from the set of edges to the set of integers {1, 2, ... ,q} such that all vertex weights are pairwise distinct, where the vertex weight is the sum of labels of all edges incident with the vertex. Let [n] = {1,2, ... , n}. A completely separating system on [n] is a collection C of subsets of [n] in which, for each pair a ≠ b ∈ [n], there exist A, B ∈ C such that a ∈ A, b ∉ A and b ∈ B,a ∉ B. Recently, a relationship between completely separating systems and labeling of graphs has been shown to exist. Based on this relationship, antimagic labelings of various graphs have been constructed. In this paper, we extend our method to produce more general results for generalized web graphs
Subject: antimagic labeling; generalized web graph; vertex weights
Identifier: http://hdl.handle.net/1959.13/1044498
Identifier: uon:14336
Identifier: ISSN:0972-8600
Language: eng
Full Text
Reviewed

		Thumbnail	File	Description	Size	Format
View Details Download			ATTACHMENT01	Publisher version (open access)	518 KB	Adobe Acrobat PDF	View Details Download