Mostrando 5 resultados de: 5
Filtros aplicados
Publisher
Developments in Mathematics(1)
Fundamenta Informaticae(1)
Graphs and Combinatorics(1)
Results in Mathematics(1)
UPB Scientific Bulletin, Series A: Applied Mathematics and Physics(1)
Origen
scopus(5)
Computing edge irregularity strength of complete m-ary trees using algorithmic approach
ArticleAbstract: Algorithms help in solving many problems, where other mathematical solutions are very complex or impPalabras claves:ALGORITHMS, Complete m-ary tree T m,h, Edge irregularity strengthAutores:Ahmad A., Asim M.A., Hasni R., Martin BačaFuentes: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:scopusNew Constructions for the n-Queens Problem
ArticleAbstract: Let D be a digraph, possibly with loops. A queen labeling of D is a bijective function l: V(G) ⟶ { 1Palabras claves:(Modular) n-queens problem, (modular) queen labeling, ⊗ -product hAutores:López S., Martin Bača, Muntaner-Batle F., Semaničova-Fenovciková A.Fuentes:scopusOn Local Antimagic Vertex Coloring for Complete Full t-ary Trees
ArticleAbstract: Let G = (V, E) be a finite simple undirected graph without K2 components. A bijection f : E → {1, 2,Palabras claves:Antimagic labeling, complete full t-ary tree, Local antimagic chromatic number, Local antimagic labelingAutores:Lai R.T., Martin Bača, Semaničova-Fenovciková A., Wang T.M.Fuentes:scopusLocal Antimagic Vertex Coloring of a Graph
ArticleAbstract: Let G= (V, E) be a connected graph with | V| = n and | E| = m. A bijection f: E→ { 1 , 2 , ⋯ , m} isPalabras claves:Antimagic labeling, Local antimagic chromatic number, Local antimagic labelingAutores:Arumugam S., Martin Bača, Premalatha K., Semaničova-Fenovciková A.Fuentes:scopus