A Result on the Strength of Graphs by Factorizations of Complete Graphs
type: Item
instance of: scholarly article
title: A Result on the Strength of Graphs by Factorizations of Complete Graphs
author: Akito Oshima
author: Rikio Ichishima
author: F. A. Muntaner-Batle
published in: Discrete Mathematics Letters
publication date: 2022-11-23T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7622435
zbMATH Keywords: strength
zbMATH Keywords: factorization
zbMATH Keywords: graph labeling
zbMATH Keywords: combinatorial optimization
MaRDI profile type: MaRDI publication profile
full work available at URL: dml.2021.0096
OpenAlex ID: W4200192564
Wikidata QID: Q114020199
cites work: Strongly indexable graphs
cites work: Q4350166
cites work: The bandwidth problem for graphs and matrices—a survey
cites work: Q3803160
cites work: A remark on a problem of Harary
cites work: Q4236613
cites work: The place of super edge-magic labelings among other classes of labelings
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Q4622634
cites work: On the strength of some trees
cites work: Minimum degree conditions for the strength and bandwidth of graphs
cites work: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
DOI: 10.47443/DML.2021.0096
description: scientific article; zbMATH DE number 7622435