No Detail Found!

The edge-strength of graphs

Author(s)
Rikio Ichishima Department of Sport and Physical Education, Faculty of Physical Education, Kokushikan University,Tama-shi, Tokyo 206-8515,Japan
Akito Oshima Graph Theory and Applications Research Group, School of Electrical Engineering and Computer Science, Faculty of Engineering and Built Environment, The University of Newcastle,NSW 2308,Australia
Yukio Takahashi Department of Science and Engineering, Faculty of Electronics and Informations, Kokushikan University,Setagaya-ku, Tokyo 154-8515,Japan
Abstract
The optimization problem studied in this paper is, for any graph G of size q, how labels 1; 2; : : : ; q can be assigned to the edges of G to minimize the maximum of the additions between the labels of all pairs of adjacent edges. If it is possible for a graph G, then we say that the minimum such number is the edge-strength of G. We provide formulas for the edge-strength of some classes of graphs whose line graphs are defined in terms of various graph operations.
Publication Details
Page(s) 44-49
DOI DOI not available
Published Journal: Discrete Mathematics Letters, Volume: 3, Issue: 0, Year: 2020

Request the full text from PASTIC

Keywords
combinatorial optimization, graph operation, edge-strength, line graph, graph labeling, strength
0

Citations

0

Downloads

14

Views