Mostrando 10 resultados de: 15
Filtros aplicados
Subtipo de publicación
Article(15)
Área temáticas
Ciencias de la computación(9)
Matemáticas(2)
Programación informática, programas, datos, seguridad(2)
Principios generales de matemáticas(1)
Álgebra(1)
Área de conocimiento
Teoría de grafos(13)
Optimización matemática(10)
Aprendizaje automático(1)
Ciencias de la computación(1)
Objetivos de Desarrollo Sostenible
ODS 17: Alianzas para lograr los objetivos(14)
ODS 9: Industria, innovación e infraestructura(14)
ODS 4: Educación de calidad(10)
ODS 8: Trabajo decente y crecimiento económico(4)
Origen
scopus(15)
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:scopusAntimagic labeling of disjoint union of s-crowns
ArticleAbstract: A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges byPalabras claves:(a,d)-edge-antimagic total labeling, S-crowns, Super (a,d)-edge-antimagic total labelingAutores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusAntimagic 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:scopusAntimagic labelings of hexagonal plane maps
ArticleAbstract: This paper deals with the problem of labeling the edges, vertices and faces of a plane graph in suchPalabras claves:Autores:Jendrol’ S., Martin Bača, Miller M., Tbaskoro E.Fuentes:scopusConsecutive-magic labeling of generalized Petersen graphs
ArticleAbstract: The generalized Petersen graph P(n, k) has vertex set V = { u1 , u2 , . . . , un , v1 , v2 , . . . ,Palabras claves:Autores:Martin BačaFuentes: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:scopusFace antimagic labelings of convex polytopes
ArticleAbstract: A connected plane graph G = (V, E, F) is said to be (a, d)-face antimagic if there exist positive inPalabras claves:Autores:Martin BačaFuentes: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:scopusSuper d-Antimagic labelings of disjoint union of generalized prisms
ArticleAbstract: The generalized prism, Pmn can be defined as the Cartesian product of a cycle on n vertices with a pPalabras claves:D-antimagic labeling, Disjoint union of generalized prisms, Plane graph, Super d-Antimagic labelingAutores:Martin Bača, Numan M., Semaničova-Fenovciková A.Fuentes:scopusSuper edge-antimagic labelings of the generalized Petersen graph P(n, (n - 1)/2)
ArticleAbstract: An (a, d)-edge-antimagic total labeling of G is a one-to-one mapping f taking the vertices and edgesPalabras claves:Autores:Martin Bača, Simanjuntak R., Sugeng K.A., Tbaskoro E.Fuentes:scopus