Mostrando 7 resultados de: 7
Filtros aplicados
Subtipo de publicación
Article(7)
Área temáticas
Ciencias de la computación(6)
Matemáticas(2)
Análisis numérico(1)
Ciencias Naturales y Matemáticas(1)
Física(1)
Origen
scopus(7)
Note 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 3-total edge product cordial labeling of a carbon nanotube network
ArticleAbstract: For a simple graph G=(V,E) with the vertex set V and the edge set E and for an integer k, 2≤k≤|E(G)|Palabras claves:Carbon nanotube network, Cordial labeling, K-total edge product cordial labelingAutores:Irfan M., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusOn H-antimagic decomposition of toroidal grids and triangulations
ArticleAbstract: Let (Formula presented.) be a finite simple graph with p vertices and q edges. A decomposition of aPalabras claves:05C78, H-antimagic graph, H-decomposition, H-supermagic graph, Toroidal grid, toroidal triangulationAutores:Hendy , Martin Bača, Mudholifah A.N., Semaničova-Fenovciková A., Sugeng K.A.Fuentes:scopusOn H-irregularity strength of ladders and fan graphs
ArticleAbstract: We investigate modifications of the well-known irregularity strength of graphs, namely, total (vertePalabras claves:H-irregular labeling, H-irregularity strength, Total (vertex, edge) -irregular labeling, Total (vertex, edge) -irregularity strengthAutores:Ashraf F., Martin Bača, Semaničova-Fenovciková A., Siddiqui M.K.Fuentes:scopusOn irregularity strength of diamond network
ArticleAbstract: In this paper we investigate the total edge irregularity strength [Formula presented] and the totalPalabras claves:Diamond graphs, total edge irregularity strength, total vertex irregularity strengthAutores:Basir H., Firmayasari D., Hinding N., Martin Bača, Semaničova-Fenovciková A.Fuentes:scopusTwo constructions of H-antimagic graphs
ArticleAbstract: Let H be a graph. A graph G=(V,E) admits an H-covering if every edge in E belongs to a subgraph of GPalabras claves:(a,d)-H-antimagic graph, Corona of graphs, H-covering, Subdivision of edges, Super (a,d)-H-antimagic graphAutores:Lascsáková M., Martin Bača, Semaničova-Fenovciková A.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