Mostrando 5 resultados de: 5
Subtipo de publicación
Article(5)
Publisher
Utilitas Mathematica(2)
Acta Mathematica Sinica, English Series(1)
Discussiones Mathematicae - Graph Theory(1)
Results in Mathematics(1)
Área temáticas
Ciencias de la computación(4)
Principios generales de matemáticas(2)
Física(1)
Álgebra(1)
Área de conocimiento
Teoría de grafos(4)
Optimización matemática(3)
Algoritmo(1)
Ciencias de la computación(1)
Origen
scopus(5)
Edge-antimagic labelings of forests
ArticleAbstract: An (a, d)-edge-antimagic total labeling of a graph G(V, E) is a one-to-one map f from V(G) U E(G) onPalabras claves:Autores:Lin Y., Martin Bača, Muntaner-Batle F.Fuentes:scopusNew Constructions for the n-Queens Problem
ArticleAbstract: Let D be a digraph, possibly with loops. A queen labeling of D is a bijective function l: V(G) ⟶ { 1Palabras claves:(Modular) n-queens problem, (modular) queen labeling, ⊗ -product hAutores:López S., Martin Bača, Muntaner-Batle F., Semaničova-Fenovciková A.Fuentes:scopusOn total h-irregularity strength of the disjoint union of graphs
ArticleAbstract: A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of GPalabras claves:copies of graphs, H-covering, H-irregular labeling, total H-irregularity strength, union of graphsAutores:Ashraf F., López S., Martin Bača, Muntaner-Batle F., Oshima A., Semaničova-Fenovciková A.Fuentes:scopusStrong labelings of linear forests
ArticleAbstract: A (p, q)-graph G is called super edge-magic if there exists a bijective function f: V (G) → E(G) → {Palabras claves:Linear forest, Path-like tree, Strong super edge magic labelingAutores:Lin Y., Martin Bača, Muntaner-Batle F., Rius-Font M.Fuentes:scopusSuper edge-antimagic labelings of the path-like trees
ArticleAbstract: A graph G = (V, E) is (a, d)-edge-antimagic total if there exists a bijective function f : V(G) ∪ E(Palabras claves:Autores:Lin Y., Martin Bača, Muntaner-Batle F.Fuentes:scopus