On Edge H-Irregularity Strengths of Some Graphs

On Edge H-Irregularity Strengths of Some Graphs

For a graph G an edge-covering of G is a family of subgraphs H1, H2, . . . , Ht such that each edge of E(G) belongs to at least one of the subgraphs Hi, i = 1, 2, . . . , t. In this case we say that G admits an (H1, H2, . . . , Ht)-(edge) covering. An H-covering of graph G is an (H1, H2, . . . , Ht)...

Full description

Bibliographic Details
Main Authors: Naeem Muhammad, Siddiqui Muhammad Kamran, Bača Martin, Semaničová-Feňovčíková Andrea, Ashraf Faraha
Format: Article
Language:English
Published: University of Zielona Góra 2021-11-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
h-irregular edge labeling
edge h-irregularity strength
prism
antiprism
triangular ladder
diagonal ladder
wheel
gear graph
05c78
05c70
Online Access:https://doi.org/10.7151/dmgt.2228

Internet

https://doi.org/10.7151/dmgt.2228

Similar Items