Irregularity strength and compound graphs
type: Item
instance of: scholarly article
title: Irregularity strength and compound graphs
zbMATH Open document ID: 0944.05088
DOI: 10.1016/S0012-365X(99)00305-2
author: Olivier Togni
published in: Discrete Mathematics
publication date: 2000-09-15T00:00:00Z
review text: The irregularity strength of a graph is the smallest integer \(k\) for which the edges may be assigned weights not exceeding \(k\), and which sum at each vertex into distinct numbers. A compound graph of two graphs \(H\) and \(G\) is obtained by replacing each vertex of \(H\) by a copy of \(G\) and adding some perfect matching between any two copies which were linked in \(H\). An upper bound is derived for the irregularity strength of a compound graph, leading to determination of the exact irregularity strength for two particular families of graphs.
reviewed by: Frank Plastria
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 11P99
zbMATH DE Number: 1453331
zbMATH Keywords: irregular networks
zbMATH Keywords: irregularity strength
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1453331