Mostrando 4 resultados de: 4
Filtros aplicados
Subtipo de publicación
Article(4)
Publisher
Discrete Mathematics(1)
Electronic Journal of Graph Theory and Applications(1)
Proceedings of the Indian Academy of Sciences: Mathematical Sciences(1)
Utilitas Mathematica(1)
On (F,H)-sim-magic labelings of graphs
ArticleAbstract: A simple graph G(V,E) admits an H-covering if every edge in G belongs to a subgraph of G isomorphicPalabras claves:(F, Cartesian product, H)-sim-(super)magic, H-(super)magic, H-covering, join productAutores:Ashari Y.F., Martin Bača, Salman A.N.M., Semaničova-Fenovciková A., Simanjuntak R.Fuentes:scopusRainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph
ArticleAbstract: An edge-colored graph G is rainbow k-connected, if for every two vertices of G, there are k internalPalabras claves:Cycle, edge-comb product, Hamiltonian graph, rainbow 2-connectivity, rainbow pathAutores:Martin Bača, Salman A.N.M., Simanjuntak R., Susanti B.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 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