Carregant...

Vés al contingut (premeu Retorn)

# FUTUR. Portal de la Producció Científica dels Investigadors de la UPC

## New problems related to the valences of (super) edge-magic labeling

Autor
López, S.C.; Muntaner-Batle, F.A.; Rius, M.
Tipus d'activitat
Article en revista
Revista
AKCE International Journal of Graphs and Combinatorics
Data de publicació
2013-08
Volum
10
Número
2
Pàgina inicial
169
Pàgina final
181
URL
http://www.scopus.com/record/display.url?eid=2-s2.0-84883823932&origin=resultslist&sort=plf-f&src=s&st1=New+problems+related+to+the+valences+of++edge-magic+labeling&sid=F95E27345E235BB14A96BD4079354CED.fM4vPBipdL1BpirDq5Cw%3a570&sot=q&sdt=b&sl=80&s=TITLE-ABS-KEY-AUTH%28New+problems+related+to+the+valences+of++edge-magic+labeling%29&relpos=0&relpos=0&citeCnt=0&searchTerm=TITLE-ABS-KEY-AUTH%28New+problems+related+to+the+valences+of++edge-magic+labeling%29
Resum
A graph G of order p and size q is edge-magic if there is a bijective function f : V(G) ¿ E(G) ¿ {i}p+q i=1 such that f(x) + f(xy) + f(y) = k, for all xy ¿ E(G). The function f is an edge-magic labeling of G and the sum k is called either the magic sum, the valence or theweight of f. Furthermore, if f(V(G)) = {i}p i=1 then f is a super edge-magic labeling of G. In this paper we study the valences that can be attained by (super) edge-magic labelings of some families of graphs
Paraules clau
Edge-magic, Super Edge-magic, Valence
Grup de recerca
COMBGRAF - Combinatòria, Teoria de Grafs i Aplicacions