Mostrando 10 resultados de: 175
Publisher
Utilitas Mathematica(18)
Ars Combinatoria(14)
Australasian Journal of Combinatorics(11)
Developments in Mathematics(10)
Electronic Journal of Graph Theory and Applications(10)
Área temáticas
Ciencias de la computación(94)
Principios generales de matemáticas(72)
Matemáticas(59)
Álgebra(52)
Programación informática, programas, datos, seguridad(9)
Área de conocimiento
Teoría de grafos(146)
Optimización matemática(91)
Algoritmo(32)
Desconocido(10)
Ciencias de la computación(7)
Edge-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: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-antimagic total labelings
Book PartAbstract: This chapter focuses on edge-antimagic graphs under both vertex labelings and total labelings. SuperPalabras claves:Autores:Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopusEdge-antimagicness for a class of disconnected graphs
ArticleAbstract: Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d)-edge-antimagic total lPalabras claves:Autores:Brankovic L., Martin BačaFuentes: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(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:scopusA Survey of Irregularity Strength
ArticleAbstract: This survey aims to give an overview of the modifications of the well-known irregular assignments, nPalabras claves:Entire face irregularity strength, face irregular entire k-labeling, Irregularity strength, Plane graphAutores:Jendrol’ S., Kathiresan K., Martin Bača, Muthugurupackiam K., Semaničova-Fenovciková A.Fuentes:scopusA 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:scopus