Mostrando 6 resultados de: 6
Publisher
Ars Combinatoria(2)
Australasian Journal of Combinatorics(1)
Electronic Journal of Graph Theory and Applications(1)
International Journal of Computer Mathematics(1)
Lecture Notes in Computer Science(1)
Área temáticas
Ciencias de la computación(2)
Principios generales de matemáticas(2)
Ciencias Naturales y Matemáticas(1)
Física aplicada(1)
Matemáticas(1)
Origen
scopus(6)
(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 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:scopusConstructions of H-antimagic graphs using smaller edge-antimagic graphs
ArticleAbstract: A simple graph G - (V, E) admits an H-covering if every edge in E belongs at least to one subgraph oPalabras claves:(Super) (a,d)-H-antimagic labeling, H-coveringAutores:Dafik D., Martin Bača, Semaničova-Fenovciková A., Slamin, Tanna D.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:scopusOn inclusive distance vertex irregular labelings
ArticleAbstract: For a simple graph G, a vertex labeling f: V (G) → (1; 2....,k) is called a k-labeling. The weight oPalabras claves:Inclusive distance vertex irregular labeling, Inclusive distance vertex irregularity strengthAutores:Martin Bača, Semaničova-Fenovciková A., Slamin, Sugeng K.A.Fuentes:scopusVertex-magic total labelings of generalized petersen graphs
ArticleAbstract: A vertex-magic total labeling of a graph G = (V, E) with ν vertices and e edges is an assignment ofPalabras claves:Petersen graphsAutores:Martin Bača, Miller M., SlaminFuentes:scopus