Mostrando 10 resultados de: 10
Filtros aplicados
Publisher
Developments in Mathematics(4)
Journal of Combinatorial Mathematics and Combinatorial Computing(2)
Ars Combinatoria(1)
Australasian Journal of Combinatorics(1)
Mathematics in Computer Science(1)
Área temáticas
Ciencias de la computación(7)
Matemáticas(3)
Principios generales de matemáticas(2)
Álgebra(2)
Esclavitud y emancipación(1)
Origen
scopus(10)
Antimagic Labelings of Join Graphs
ArticleAbstract: An antimagic labeling of a graph with q edges is a bijection from the set of edges of the graph to tPalabras claves:Antimagic labeling, Complete multipartite graph, Join graphAutores:Martin Bača, Phanalasy O., Ryan J., Semaničova-Fenovciková A.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 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: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:scopusOn antimagic labelings of disjoint union of complete s-partite graphs
Conference ObjectAbstract: By an (a, d)-edge-antimagic total labeling of a graph G(V, E) we mean a bijective function f from V(Palabras claves:(a,d)-edge-antimagic total labeling, Complete s-partite graph, Super (a, d) -edge-antimagic total labelingAutores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopusMagic and antimagic graphs: Attributes, observations, and challenges in graph labelings
Book PartAbstract:Palabras claves:Autores:Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopusVertex-magic total labelings
Book PartAbstract: This chapter is devoted to the study of vertex magic total labelings. Constructions are given for rePalabras claves:Autores:Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopusSuper edge-antimagic total labelings of mK<inf>n,n,n</inf>
ArticleAbstract: An (a, d)-edge-antimagic total labeling on (p, q)-graph G is a one-to-one map f from V(G) ∪ E(G)Palabras claves:MK and K ∪ 2sK n,n,n 1,m 1,n, Super (a,d)-edge-antimagic total labelingAutores:Dafik D., Martin Bača, Miller M., Ryan J.Fuentes:scopus