Mostrando 8 resultados de: 8
Filtros aplicados
Subtipo de publicación
Article(8)
Publisher
Electronic Notes in Discrete Mathematics(2)
Mathematics in Computer Science(2)
Australasian Journal of Combinatorics(1)
Journal of Applied Mathematics(1)
Journal of Computational and Theoretical Nanoscience(1)
Área temáticas
Ciencias de la computación(4)
Análisis(1)
Ciencias sociales(1)
Ingeniería civil(1)
Inglés e inglés antiguo (anglosajón)(1)
Área de conocimiento
Teoría de grafos(5)
Optimización matemática(2)
Ciencia de materiales(1)
Nanopartícula(1)
Origen
scopus(8)
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: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:scopusOn (a,1)-vertex-antimagic edge labeling of regular graphs
ArticleAbstract: An (a,s)-vertex-antimagic edge labeling (or an (a,s)-VAE labeling, for short) of G is a bijective maPalabras claves:Autores:Martin Bača, Semaničova-Fenovciková A., Wang T.M., Zhang G.Fuentes:scopusOn Topological Indices of Multi-Walled Carbon Nanotubes
ArticleAbstract: A molecular graph is a graph in which vertices are atoms of a given molecule and edges are its chemiPalabras claves:Atom-bond connectivity index, Carbon nanotube network., Geometric-arithmetic index, index, RandićAutores:Horváthová J., Martin Bača, Mokrišová M., Semaničova-Fenovciková A., Suhányiová A.Fuentes:scopusTree-antimagicness of disconnected graphs
ArticleAbstract: A simple graph G admits an H -covering if every edge in E (G) belongs to a subgraph of G isomorphicPalabras claves:Autores:Kimáková Z., Martin Bača, Semaničova-Fenovciková A., Umar M.A.Fuentes:scopusWheels are Cycle-Antimagic
ArticleAbstract: A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic toPalabras claves:(super) (a, d)-H-antimagic total labeling, Cycle-antimagic labeling, H-covering, WheelAutores:Lascsáková M., Martin Bača, Miller M., Ryan J., Semaničova-Fenovciková A.Fuentes:scopusTotal Irregularity Strength of Three Families of Graphs
ArticleAbstract: We deal with the totally irregular total labeling which is required to be at the same time vertex irPalabras claves:Edge irregular total labeling, Totally irregular total labeling, Vertex irregular total labelingAutores:Assiyatun H., Martin Bača, Ramdani R., Salman A.N.M., Semaničova-Fenovciková A.Fuentes:scopusTotally antimagic total graphs
ArticleAbstract: For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . ., |V(G)|Palabras claves:Autores:Martin Bača, Miller M., Phanalasy O., Ryan J., Semaničova-Fenovciková A., Sillasen A.A.Fuentes:scopus