Universitat de Lleida
    • English
    • català
    • español
  • español 
    • English
    • català
    • español
  • Iniciar sesión
Repositori Obert UdL
Ver ítem 
  •   Inicio
  • Recerca
  • Matemàtica
  • Articles publicats (Matemàtica)
  • Ver ítem
  •   Inicio
  • Recerca
  • Matemàtica
  • Articles publicats (Matemàtica)
  • Ver ítem
JavaScript is disabled for your browser. Some features of this site may not work without it.

Enumerating super edge-magic labelings for the union of nonisomorphic graphs

Thumbnail
Ver/Abrir
Preprint (260.4Kb)
Fecha de publicación
2011
Autor/a
Ahmad, Ali
López Masip, Susana-Clara
Muntaner Batle, F. A.
Rius Font, Miquel
Cita recomendada
Ahmad, Ali; López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel; . (2011) . Enumerating super edge-magic labelings for the union of nonisomorphic graphs. Bulletin of the Australian Mathematical Society, 2011, vol. 84, num. 2, p. 310-321. https://doi.org/10.1017/S0004972711002292.
Impacto


Logo de Web of Science    citaciones en Web of Science

Logo de Scopus    citaciones en Scopus

Logo de Google Académico  Google Académico
Compartir
Exportar a Mendeley
Metadatos
Mostrar el registro completo del ítem
Resumen
A super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1 such that: (1) f(u)+f(uv)+f(v)=k for all uv∈E; and (2) f(V )={i}pi=1. Furthermore, when G is a linear forest, the super edge-magic labeling of G is called strong if it has the extra property that if uv∈E(G) , u′,v′ ∈V (G) and dG (u,u′ )=dG (v,v′ )<+∞, then f(u)+f(v)=f(u′ )+f(v′ ). In this paper we introduce the concept of strong super edge-magic labeling of a graph G with respect to a linear forest F, and we study the super edge-magicness of an odd union of nonnecessarily isomorphic acyclic graphs. Furthermore, we find exponential lower bounds for the number of super edge-magic labelings of these unions. The case when G is not acyclic will be also considered.
URI
http://hdl.handle.net/10459.1/66072
DOI
https://doi.org/10.1017/S0004972711002292
Es parte de
Bulletin of the Australian Mathematical Society, 2011, vol. 84, num. 2, p. 310-321
Proyectos de investigación europeos
Colecciones
  • Publicacions de projectes de recerca del Plan Nacional [2179]
  • Articles publicats (Matemàtica) [263]

Publicaciones relacionadas

Showing items related by title, author, creator and subject.

  • New problems related to the valences of (super) edge-magic labelings 

    López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (2013)
    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 ...
  • Labeling constructions using digraph products 

    López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (Elsevier, 2013)
    In this paper we study the edge-magicness of graphs with equal size and order, and we use such graphs and digraph products in order to construct labelings of different classes and of different graphs. We also study super ...
  • Enumerating super edge-magic labelings for some types of path-like trees 

    López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (University of Manitoba, 2015)
    The main goal of this paper is to use a variation of the Kronecker product of matrices in order to obtain lower bounds for the number of non isomorphic super edge-magic labelings of some types of pathlike trees. As a ...

Contacto | Sugerencias | Aviso legal
© 2021 BiD. Universitat de Lleida
Metadatos sujetos a 
 

 

Explorar

Todo el repositorioComunidades y coleccionesPor fecha de publicaciónAutoresTítulosMateriasEsta colecciónPor fecha de publicaciónAutoresTítulosMaterias

Estadísticas

Ver Estadísticas de uso

De interés

Política institucional d'accés obertDiposita les teves publicacionsDiposita dades de recercaSuport a la recerca

Contacto | Sugerencias | Aviso legal
© 2021 BiD. Universitat de Lleida
Metadatos sujetos a