QR код

On Total H-Irregularity Strength of the Disjoint Union of Graphs

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...

Бүрэн тодорхойлолт

-д хадгалсан:
Номзүйн дэлгэрэнгүй
Үндсэн зохиолчид: Ashraf Faraha, López Susana Clara, Muntaner-Batle Francesc Antoni, Oshima Akito, Bača Martin, Semaničová-Feňovčíková Andrea
Формат: Artigo
Хэл сонгох:Inglês
Хэвлэсэн: University of Zielona Góra 2020-02-01
Цуврал:Discussiones Mathematicae Graph Theory
Нөхцлүүд:
Онлайн хандалт:https://doi.org/10.7151/dmgt.2118
Шошгууд: Шошго нэмэх
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!