Premium
Numbers of edges in supermagic graphs
Author(s) -
Drajnová Svetlana,
Ivančo Jaroslav,
Semaničová Andrea
Publication year - 2006
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20144
Subject(s) - combinatorics , mathematics , vertex (graph theory) , pairwise comparison , graph , discrete mathematics , statistics
A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we establish some bounds for the number of edges in supermagic graphs. © 2005 Wiley Periodicals, Inc. J Graph Theory 52: 15–26, 2006
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom