Mostrando 4 resultados de: 4
Subtipo de publicación
Article(4)
Publisher
Discussiones Mathematicae - Graph Theory(2)
AKCE International Journal of Graphs and Combinatorics(1)
Electronic Journal of Graph Theory and Applications(1)
Área temáticas
Ciencias de la computación(4)
Matemáticas(2)
Física(1)
Física aplicada(1)
Métodos informáticos especiales(1)
Origen
scopus(4)
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 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 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 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