Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A Problem on Edge-magic Labelings of Cycles

Autor
López, S.C.; Muntaner-Batle, F.A.; Rius, M.
Tipus d'activitat
Article en revista
Revista
Canadian mathematical bulletin. Bulletin canadien de mathématiques
Data de publicació
2014-06-01
Volum
57
Número
2
Pàgina inicial
375
Pàgina final
380
DOI
https://doi.org/10.4153/CMB-2013-036-1 Obrir en finestra nova
Projecte finançador
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Resum
In 1970, Kotzig and Rosa defined the concept of edge-magic labelings as follows. Let G be a simple (p, q)-graph (that is, a graph of order p and size q without loops or multiple edges). A bijective function f: V(G)boolean OR E(G) -> {1, 2,..., p+q} is an edge-magic labeling of G if f(u) + f(uv) + f(v) = k, for all uv is an element of E(G). A graph that admits an edge-magic labeling is called an edge-magic graph, and k is called the magic sum of the labeling. An old conjecture of Godbold and Slat...
Paraules clau
GRAPHS, circle times(h)-product, edge-magic, valence
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants