Documentos de Martin Bača | REDI

Regresar

Mostrando 7 resultados de: 7

Filtros aplicados

Palabras Claves: "H-covering"

Subtipo de publicación

Publisher

AKCE International Journal of Graphs and Combinatorics(1)

Ars Combinatoria(1)

Discussiones Mathematicae - Graph Theory(1)

Electronic Journal of Graph Theory and Applications(1)

Electronic Notes in Discrete Mathematics(1)

Área temáticas

Ciencias de la computación(5)

Ciencias Naturales y Matemáticas(2)

Matemáticas(2)

Métodos informáticos especiales(1)

Área de conocimiento

Teoría de grafos(5)

Optimización matemática(3)

Año de Publicación

Origen

Palabras Claves

Cartesian product(2)

Cycle-antimagic labeling(2)

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

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

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.

Ladders and fan graphs are cycle-antimagic

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

Palabras claves:

(Super) (a,d)-H-antimagic total labeling, Cycle-antimagic labeling, fan graph, H-covering, Ladder

Jeyanthi P., Martin Bača, Muthuraja N.T., Selvagopal P.N., Semaničova-Fenovciková A.

On (F,H)-sim-magic labelings of graphs

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

Palabras claves:

(F, Cartesian product, H)-sim-(super)magic, H-(super)magic, H-covering, join product

Ashari Y.F., Martin Bača, Salman A.N.M., Semaničova-Fenovciková A., Simanjuntak R.

On H-antimagicness of Cartesian product of graphs

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

Palabras claves:

Cartesian product, H-covering, Partition of set, Super (a, d) -H-antimagic graph

Martin Bača, Semaničova-Fenovciková A., Umar M.A., Welyyanti D.

On total h-irregularity strength of the disjoint union of graphs

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

Palabras claves:

copies of graphs, H-covering, H-irregular labeling, total H-irregularity strength, union of graphs

Ashraf F., López S., Martin Bača, Muntaner-Batle F., Oshima A., Semaničova-Fenovciková A.

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.