Mostrando 8 resultados de: 8
Publisher
Utilitas Mathematica(2)
AKCE International Journal of Graphs and Combinatorics(1)
Acta Mathematica Sinica, English Series(1)
Australasian Journal of Combinatorics(1)
Developments in Mathematics(1)
Área de conocimiento
Teoría de grafos(7)
Optimización matemática(2)
Aprendizaje automático(1)
Ciencias de la computación(1)
Origen
scopus(8)
A method to generate large classes of edge-antimagic trees
ArticleAbstract: A (p, q)-graph G is said to be graceful if the vertices can be assigned the labels {1,2,...,q+ 1} suPalabras claves:Edge-antimagic total labeling, Graceful labeling, Tree, α-labelingAutores:Martin Bača, Semaničova-Fenovciková A., Shafiq M.K.Fuentes:scopusA survey of face-antimagic evaluations of graphs
ArticleAbstract: The concept of face-antimagic labeling of plane graphs was introduced by Mirka Miller in 2003. ThisPalabras claves:Autores:Brankovic L., Jendrol’ S., Lin Y., Martin Bača, Phanalasy O., Ryan J., Semaničova-Fenovciková A., Slamin, Sugeng K.A., Tbaskoro E.Fuentes:scopusEdge-antimagic graphs
ArticleAbstract: For a graph G = (V, E), a bijection g from V (G) ∪ E (G) into { 1, 2, ...,| V (G) | + | E (G) | } isPalabras claves:Edge-antimagic labeling, Edge-weightAutores:Lin Y., Martin Bača, Miller M., Youssef M.Z.Fuentes:scopusNormalized embedding of path-like trees
ArticleAbstract: We study properties of path-like trees which can be obtained from a set of elementary transformationPalabras claves:Autores:Lin Y., Martin Bača, Muntaner-Batle E.Fuentes:scopusNote on edge irregular reflexive labelings of graphs
ArticleAbstract: For a graph G, an edge labeling fe:E(G)→{1,2,…,ke} and a vertex labeling fv:V(G)→{0,2,4,…,2kv} are cPalabras claves:Cartesian product of cycles, Cycles, Edge irregular reflexive labeling, Reflexive edge strengthAutores:Irfan M., Martin Bača, Ryan J., Semaničova-Fenovciková A., Tanna D.Fuentes:scopusOn (a,1)-vertex-antimagic edge labeling of regular graphs
ArticleAbstract: An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective maPalabras claves:Autores:Martin Bača, Semaničova-Fenovciková A., Wang T.M., Zhang G.Fuentes:scopusVertex-antimagic labelings of regular graphs
ArticleAbstract: Let G = (V,E) be a finite, simple and undirected graph with p vertices and q edges. An (a, d)-vertexPalabras claves:Regular graph, Super vertex-antimagic total labeling, vertex-antimagic edge labelingAutores:Ahmad A., Ali K., Kovář P., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusVertex-antimagic total labelings
Book PartAbstract: Following the chapters on magic type labelings, this chapter begins the section of the book devotedPalabras claves:Autores:Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopus