On antimagic labeling for generalized web and flower graphs

Title: On antimagic labeling for generalized web and flower graphs
Creator: Ryan, Joe; Phanalasy, Oudone; Miller, Mirka; Rylands, Leanne
Relation: IWOCA 2010: The 21st Inter- national Workshop on Combinatorial Algorithms. Combinatorial Algorithms: 21st International Workshop, IWOCA 2010 London, UK, July 26-28, 2010 Revised Selected Papers (London 26-28 July, 2010) p. 303-313
Publisher Link: http://dx.doi.org/10.1007/978-3-642-19222-7_31
Publisher: Springer
Resource Type: conference paper
Date: 2011
Description: An antimagic labeling of a graph with p vertices and 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 a vertex weight is the sum of labels of all edges incident with the vertex. A graph is antimagic if it has an antimagic labeling. Completely separating systems arose from certain problems in information theory and coding theory. Recently these systems have been shown to be useful in constructing antimagic labelings of particular graphs.
Subject: m-level generalized web graph; m-level generalized flower graph
Identifier: http://hdl.handle.net/1959.13/1356753
Identifier: uon:31775
Identifier: ISBN:9783642192210
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format