The irregularity strength of \(tK_ p\)
type: Item
instance of: scholarly article
title: The irregularity strength of \(tK_ p\)
zbMATH Open document ID: 0834.05029
DOI: 10.1016/0012-365X(94)E0043-H
author: Michal Tkáč
author: Stanislav Jendroľ
published in: Discrete Mathematics
publication date: 1995-10-29T00:00:00Z
review text: The irregularity strength of a simple graph is the smallest integer for which the edges may be assigned weights not exceeding it, such that the weight sums of adjacent edges are different at all vertices. A general formula is obtained for the irregularity strength of disjoint unions of identical complete graphs.
reviewed by: Frank Plastria
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 11P99
zbMATH DE Number: 810275
zbMATH Keywords: irregular networks
zbMATH Keywords: irregularity strength
zbMATH Keywords: weight sums
MaRDI profile type: Publication
cites work: Q3824455
cites work: On the irregularity strength of them ×n grid
cites work: Irregularity strength of dense graphs
cites work: Irregular networks, regular graphs and integer matrices with distinct row and column sums
cites work: Q4873753
description: scientific article; zbMATH DE number 810275