Documentos de Slamin | REDI

Regresar

Mostrando 4 resultados de: 4

Filtros aplicados

Área de conocimiento: "Teoría de grafos"

Subtipo de publicación

Conference Object(1)

Publisher

Ars Combinatoria(1)

Australasian Journal of Combinatorics(1)

International Journal of Computer Mathematics(1)

Lecture Notes in Computer Science(1)

Área temáticas

Ciencias de la computación(2)

Ciencias Naturales y Matemáticas(1)

Física aplicada(1)

Matemáticas(1)

Principios generales de matemáticas(1)

Área de conocimiento

Optimización matemática(2)

Año de Publicación

Origen

Palabras Claves

(Super) (a,d)-H-antimagic labeling(1)

Petersen graphs(1)

(a, d)-Edge-antimagic total labelings of caterpillars

Conference Object

Abstract: For a graph G = (V, E), a bijection g from V(G) ∪E(G) into {1,2,..., |V(G)| + |E(G)|} is called (a,

Palabras claves:

Martin Bača, Miller M., Slamin, Sugeng K.A.

A survey of face-antimagic evaluations of graphs

Abstract: The concept of face-antimagic labeling of plane graphs was introduced by Mirka Miller in 2003. This

Palabras claves:

Brankovic L., Jendrol’ S., Lin Y., Martin Bača, Phanalasy O., Ryan J., Semaničova-Fenovciková A., Slamin, Sugeng K.A., Tbaskoro E.

Constructions of H-antimagic graphs using smaller edge-antimagic graphs

Abstract: A simple graph G - (V, E) admits an H-covering if every edge in E belongs at least to one subgraph o

Palabras claves:

(Super) (a,d)-H-antimagic labeling, H-covering

Dafik D., Martin Bača, Semaničova-Fenovciková A., Slamin, Tanna D.

Vertex-magic total labelings of generalized petersen graphs

Abstract: A vertex-magic total labeling of a graph G = (V, E) with ν vertices and e edges is an assignment of

Palabras claves:

Petersen graphs

Martin Bača, Miller M., Slamin