New problems related to the valences of (super) edge-magic labelings
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 the weight of f . Furtherm...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2013 |
| País: | España |
| Institución: | Universitat de Lleida (UdL) |
| Repositorio: | Repositori Obert UdL |
| OAI Identifier: | oai:repositori.udl.cat:10459.1/66462 |
| Acceso en línea: | https://doi.org/10.1080/09728600.2013.12088733 http://hdl.handle.net/10459.1/66462 |
| Access Level: | acceso abierto |
| Palabra clave: | Edge-magic Super edge-magic Valence |
| Sumario: | 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 the weight 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. |
|---|