Mostrando 4 resultados de: 4
Filtros aplicados
Subtipo de publicación
Article(4)
Publisher
Utilitas Mathematica(2)
Acta Mathematica Sinica, English Series(1)
Discussiones Mathematicae - Graph Theory(1)
Área temáticas
Ciencias de la computación(3)
Principios generales de matemáticas(2)
Física(1)
Álgebra(1)
Área de conocimiento
Optimización matemática(3)
Origen
scopus(4)
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: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