Documentos de Lascsáková M. | REDI

Regresar

Mostrando 2 resultados de: 2

Filtros aplicados

Palabras Claves: "H-covering"

Subtipo de publicación

Publisher

AKCE International Journal of Graphs and Combinatorics(1)

Electronic Notes in Discrete Mathematics(1)

Área temáticas

Ciencias de la computación(1)

Área de conocimiento

Optimización matemática(1)

Teoría de grafos(1)

Año de Publicación

Origen

Palabras Claves

(a,d)-H-antimagic graph(1)

(super) (a, d)-H-antimagic total labeling(1)

Corona of graphs(1)

Cycle-antimagic labeling(1)

Subdivision of edges(1)

Two constructions of H-antimagic graphs

Abstract: Let H be a graph. A graph G=(V,E) admits an H-covering if every edge in E belongs to a subgraph of G

Palabras claves:

(a,d)-H-antimagic graph, Corona of graphs, H-covering, Subdivision of edges, Super (a,d)-H-antimagic graph

Lascsáková M., Martin Bača, Semaničova-Fenovciková A.

Wheels are Cycle-Antimagic

Abstract: A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to

Palabras claves:

(super) (a, d)-H-antimagic total labeling, Cycle-antimagic labeling, H-covering, Wheel

Lascsáková M., Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.