Mostrando 6 resultados de: 6
Filtros aplicados
Subtipo de publicación
Article(6)
Área temáticas
Ciencias de la computación(3)
Matemáticas(2)
Ciencias Naturales y Matemáticas(1)
Métodos informáticos especiales(1)
Objetivos de Desarrollo Sostenible
ODS 17: Alianzas para lograr los objetivos(6)
ODS 9: Industria, innovación e infraestructura(6)
ODS 4: Educación de calidad(5)
ODS 8: Trabajo decente y crecimiento económico(1)
Origen
scopus(6)
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:scopusOn H-irregularity strengths of G-amalgamation of graphs
ArticleAbstract: A simple graph G = (V (G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one sPalabras claves:Amalgamation of graphs, Edge) H-irregular labeling, Edge) H-irregularity strength, Total (vertexAutores:Ashraf F., Martin Bača, Semaničova-Fenovciková A., Shabbir A.Fuentes: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:scopusOn reflexive edge strength of generalized prism graphs
ArticleAbstract: Let G be a connected, simple and undirected graph. The assignments {0,2,…,2kv} to the vertices and {Palabras claves:Generalized prism graph, Reflexive edge irregular labeling, Reflexive edge strengthAutores:Irfan M., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusOn total edge product cordial labeling of fullerenes
ArticleAbstract: For a simple graph G = (V,E) this paper deals with the existence of an edge labeling ψ: E(G) → {0, 1Palabras claves:Cordial labeling, K-total edge product cordial labeling, Klein-bottle fullerenes, Toroidal fullerenesAutores:Irfan M., Javed A., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusModular irregularity strength on some flower graphs
ArticleAbstract: Let G = (V (G),E(G)) be a graph with the nonempty vertex set V (G) and the edge set E(G). Let Zn bePalabras claves:daisy graphs, modular irregular labeling, modular irregularity strength, rose graphs, sunflower graphsAutores:Anwar L.F., John P., Lawrence M.L., Martin Bača, Semaničova-Fenovciková A., Sugeng K.A.Fuentes:scopus