Mostrando 4 resultados de: 4
Filtros aplicados
Subtipo de publicación
Article(4)
Área temáticas
Ciencias de la computación(3)
Ciencias Naturales y Matemáticas(2)
Matemáticas(2)
Programación informática, programas, datos, seguridad(1)
Área de conocimiento
Teoría de grafos(4)
Constructions of H-antimagic graphs using smaller edge-antimagic graphs
ArticleAbstract: A simple graph G - (V, E) admits an H-covering if every edge in E belongs at least to one subgraph oPalabras claves:(Super) (a,d)-H-antimagic labeling, H-coveringAutores:Dafik D., Martin Bača, Semaničova-Fenovciková A., Slamin, Tanna D.Fuentes:scopusNote on edge irregular reflexive labelings of graphs
ArticleAbstract: For a graph G, an edge labeling fe:E(G)→{1,2,…,ke} and a vertex labeling fv:V(G)→{0,2,4,…,2kv} are cPalabras claves:Cartesian product of cycles, Cycles, Edge irregular reflexive labeling, Reflexive edge strengthAutores:Irfan M., Martin Bača, Ryan J., Semaničova-Fenovciková A., Tanna D.Fuentes:scopusOn edge irregular reflexive labellings for the generalized friendship graphs
ArticleAbstract: We study an edge irregular reflexive k-labelling for the generalized friendship graphs, also known aPalabras claves:Cycles, Edge irregular reflexive labelling, Generalized friendship graph, Reflexive edge strengthAutores:Irfan M., Martin Bača, Ryan J., Semaničova-Fenovciková A., Tanna D.Fuentes:scopusVertex irregular reflexive labeling of prisms and wheels
ArticleAbstract: For a graph (Formula presented.) we define (Formula presented.) -labeling (Formula presented.) suchPalabras claves:fan graph, prism, Reflexive vertex strength, Vertex irregular reflexive labeling, WheelAutores:Martin Bača, Ryan J., Semaničova-Fenovciková A., Tanna D.Fuentes:scopus