Mostrando 10 resultados de: 10
Subtipo de publicación
Article(10)
Publisher
Utilitas Mathematica(5)
Discrete Mathematics(2)
Acta Mathematica Sinica, English Series(1)
Ars Combinatoria(1)
Australasian Journal of Combinatorics(1)
Área temáticas
Ciencias de la computación(5)
Programación informática, programas, datos, seguridad(3)
Principios generales de matemáticas(2)
Álgebra(1)
Área de conocimiento
Teoría de grafos(7)
Optimización matemática(5)
Aprendizaje automático(1)
Ciencias de la computación(1)
Origen
scopus(10)
Antimagic labelings of grids
ArticleAbstract: In this paper we deal with the problem of labeling the vertices, edges and faces of a grid graph byPalabras claves:Antimagic labeling, Face weight, Graph labeling, Grid, Labeling of type (1,1,1)Autores:Lin Y., Martin Bača, Miller M.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:scopusFace antimagic labelings of prisms
ArticleAbstract: This paper deals with the problem of labeling the vertices, edges and faces of a plane graph in suchPalabras claves:Autores:Lin Y., Martin Bača, Miller M., Sugeng K.A.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:scopusEdge-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: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:scopusOn d-antimagic labelings of prisms
ArticleAbstract: We refer to a labeling of a plane graph as a d-antimagic labeling if the vertices, edges and faces oPalabras claves:Autores:Lin Y., Martin Bača, Miller M., SlaminFuentes: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:scopusSuper-vertex-antimagic total labelings of disconnected graphs
ArticleAbstract: Let G = (V, E) be a finite, simple and non-empty (p, q)-graph of order p and size q. An (a, d)-vertePalabras claves:(a, d)-vertex-antimagic total labeling, Disconnected graphs, Super-(a, d)-vertex-antimagic total labelingAutores:Ali G., Lin Y., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopus