A Result on the Strength of Graphs by Factorizations of Complete Graphs

DOI10.47443/dml.2021.0096OpenAlexW4200192564WikidataQ114020199 ScholiaQ114020199MaRDI QIDQ5051422

Akito Oshima, Francesc Antoni Muntaner-Batle, Rikio Ichishima

Publication date: 23 November 2022

Published in: Discrete Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.47443/dml.2021.0096

zbMATH Keywords

combinatorial optimizationfactorizationstrengthgraph labeling

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Some New Results on the Edge-Strength and Strength of Graphs ⋮ Minimum degree conditions for the strength and bandwidth of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strongly indexable graphs
• Minimum degree conditions for the strength and bandwidth of graphs
• The bandwidth problem for graphs and matrices—a survey
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• On the strength of some trees
• Optimal numberings and isoperimetric problems on graphs
• A remark on a problem of Harary
• The place of super edge-magic labelings among other classes of labelings

This page was built for publication: A Result on the Strength of Graphs by Factorizations of Complete Graphs