Mostrando 10 resultados de: 17
Filtros aplicados
Publisher
Developments in Mathematics(4)
Utilitas Mathematica(3)
Ars Combinatoria(2)
Australasian Journal of Combinatorics(2)
Journal of Combinatorial Mathematics and Combinatorial Computing(2)
Área temáticas
Ciencias de la computación(10)
Matemáticas(5)
Principios generales de matemáticas(5)
Álgebra(3)
Sistemas(2)
Origen
scopus(17)
Antimagic 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 labeling of the union of two stars
ArticleAbstract: Let G be a graph of order p and size q. An (a, d)-edge-antimagic total labeling of G is a one-to-onePalabras claves:Autores: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:scopusAntimagic valuations for the special class of plane graphs
Conference ObjectAbstract: We deal with the problem of labeling the vertices, edges and faces of a special class of plane graphPalabras claves:Autores:Martin Bača, Miller M., Tbaskoro E.Fuentes:scopusAntimagic valuations of generalized Petersen graphs
ArticleAbstract: A connected graph G is said to be (a, d)-antimagic, for some positive integers a and d, if its edgesPalabras claves:Autores:Martin Bača, Miller M.Fuentes:scopus(a, d)-Edge-antimagic total labelings of caterpillars
Conference ObjectAbstract: For a graph G = (V, E), a bijection g from V(G) ∪E(G) into {1,2,..., |V(G)| + |E(G)|} is called (a,Palabras claves:Autores:Martin Bača, Miller M., Slamin, Sugeng K.A.Fuentes:scopusGraceful and antimagic labelings
Book PartAbstract: This chapter explores the relationship between antimagic labeling and alpha labelings and also the wPalabras claves:Autores:Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopusEdge-antimagic total labeling of disjoint union of caterpillars
Conference ObjectAbstract: Let G = (V, E) be a finite graph, where V(G) and E(G) are the (non-empty) sets of vertices and edgesPalabras claves:Autores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusEdge-magic total labelings
Book PartAbstract: After vertex magic total labelings, this chapter has a focus on edge magic total labelings. LabelingPalabras claves:Autores:Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopus