Mostrando 8 resultados de: 8
Filtros aplicados
Publisher
Utilitas Mathematica(2)
Australasian Journal of Combinatorics(1)
Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie(1)
Discrete Mathematics(1)
Journal of Combinatorial Mathematics and Combinatorial Computing(1)
Área temáticas
Ciencias de la computación(4)
Matemáticas(3)
Principios generales de matemáticas(3)
Álgebra(2)
Análisis(1)
Área de conocimiento
Optimización matemática(5)
Origen
scopus(8)
Antimagic labelings of hexagonal plane maps
ArticleAbstract: This paper deals with the problem of labeling the edges, vertices and faces of a plane graph in suchPalabras claves:Autores:Jendrol’ S., Martin Bača, Miller M., Tbaskoro E.Fuentes:scopusAntimagic valuations for the special class of plane graphs
Conference ObjectAbstract: We deal with the problem of labeling the vertices, edges and faces of a special class of plane graphPalabras claves:Autores:Martin Bača, Miller M., Tbaskoro E.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:scopusOn d-antimagic labelings for a special class of plane graphs
ArticleAbstract: A bijection λ: VυEυF → {1, 2, 3,..., V + E + F } is called a d-antimagic labeling of type (1, 1, 1)Palabras claves:Autores:Cholily Y.M., Martin Bača, Tbaskoro E.Fuentes:scopusOn the partition dimension of two-component graphs
ArticleAbstract: In this paper, we continue investigating the partition dimension for disconnected graphs. We determiPalabras claves:component, Disconnected graph, Partition dimensionAutores:Haryeni D.O., Martin Bača, Saputro S.W., Semaničova-Fenovciková A., Tbaskoro E.Fuentes:scopusSuper edge-antimagic labelings of the generalized Petersen graph P(n, (n - 1)/2)
ArticleAbstract: An (a, d)-edge-antimagic total labeling of G is a one-to-one mapping f taking the vertices and edgesPalabras claves:Autores:Martin Bača, Simanjuntak R., Sugeng K.A., Tbaskoro E.Fuentes:scopusThe metric dimension of regular bipartite graphs
ArticleAbstract: A set of vertices W resolves a graph G if every vertex is uniquely determined by its vector of distaPalabras claves:Basis, Bipartite graph, Metric dimension, Regular graphAutores:Martin Bača, Salman A.N.M., Saputro S.W., Suprijanto D., Tbaskoro E.Fuentes:scopusThe metric dimension of the lexicographic product of graphs
ArticleAbstract: A set of vertices W resolves a graph G if every vertex is uniquely determined by its coordinate of dPalabras claves:Basis, Lexicographic product, Metric dimension, Resolving setAutores:Assiyatun H., Martin Bača, Salman A.N.M., Saputro S.W., Simanjuntak R., Tbaskoro E., Uttunggadewa S.Fuentes:scopus