Wheels are cycle-antimagic

Title: Wheels are cycle-antimagic
Creator: Semaničová-Feňovčíková, Andrea; Bača, Martin; Lascsáková, Marcela; Miller, Mirka; Ryan, Joe
Relation: Electronic Notes in Discrete Mathematics Vol. 48, Issue July 2015, p. 11-18
Publisher Link: http://dx.doi.org/10.1016/j.endm.2015.05.003
Publisher: Elsevier
Resource Type: journal article
Date: 2015
Description: A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. An (a, d)-H-antimagic total labeling of a graph G admitting an H-covering is a bijective function from the vertex set V(G) and the edge set E(G) of the graph G onto the set of integers {1, 2, ..., |V(G)|+|E(G)|} such that for all subgraphs H' isomorphic to H, the sum of labels of all the edges and vertices belonging to H' constitute the arithmetic progression with the initial term a and the common difference d. Such a labeling is called super if the smallest possible labels appear on the vertices. In this paper, we investigate the existence of super cycle-antimagic total labelings of wheel.
Subject: H-covering; (super) (a, d)-H-antimagic total labeling; cycle-antimagic labeling; wheel
Identifier: http://hdl.handle.net/1959.13/1330917
Identifier: uon:26506
Identifier: ISSN:1571-0653
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format