On total H-irregularity strength of the disjoint union of graphs

Autor:	Andrea Semaničová-Feňovčíková, Faraha Ashraf, Akito Oshima, Francesc-Antoni Muntaner-Batle, Martin Bača, S. C. López
Rok vydání:	2020
Předmět:	copies of graphs 05c70 Applied Mathematics h-irregular labeling union of graphs Combinatorics Disjoint union (topology) QA1-939 h-covering Discrete Mathematics and Combinatorics 05c78 total h-irregularity strength Mathematics
Zdroj:	Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 181-194 (2020)
ISSN:	2083-5892 1234-3099
DOI:	10.7151/dmgt.2118
Popis:	A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and edges belonging to H. The total k-labeling is called the H-irregular total k-labeling of a graph G admitting an H-covering if all subgraphs of G isomorphic to H have distinct weights. The total H-irregularity strength of a graph G is the smallest integer k such that G has an H-irregular total k-labeling.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::930377bdf00692485a1b9937df231e31 https://doi.org/10.7151/dmgt.2118 Zobrazit plný text záznamu Plný text ve formátu PDF