Mostrando 2 resultados de: 2
On Edge H-Irregularity Strengths of Some Graphs
ArticleAbstract: For a graph G an edge-covering of G is a family of subgraphs H1, H2, Ht such that each edge of E(G)Palabras claves:antiprism, diagonal ladder, Edge H-irregularity strength, gear graph, H-irregular edge labeling, prism, triangular ladder, WheelAutores:Ashraf F., Martin Bača, Naeem M., Semaničova-Fenovciková A., Siddiqui M.K.Fuentes:scopusOn total h-irregularity strength of the disjoint union of graphs
ArticleAbstract: A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of GPalabras claves:copies of graphs, H-covering, H-irregular labeling, total H-irregularity strength, union of graphsAutores:Ashraf F., López S., Martin Bača, Muntaner-Batle F., Oshima A., Semaničova-Fenovciková A.Fuentes:scopus