No Detail Found!

Some new results on the edge-strength and strength of graphs

Author(s)
Rikio Ichishima Department of Sport and Physical Education, Faculty of Physical Education, Kokushikan University,7-3-1 Nagayama, Tama-shi, Tokyo,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 Informatics, Kokushikan University,4-28-1 Setagaya, Setagaya-ku, Tokyo,Japan
Abstract
An edge numbering f of a graph G of size m is a labeling that assigns distinct elements of the set f1; 2; : : : ; mg to the edges of G. The edge-strength estr(G) of G is defined by estr (G) = min festrf (G) j f is an edge numbering of G g, where estrf (G) = max ff (e1) + f (e2) j e1; e2 are adjacent edges of G g. In this paper, formulas for estr (G) are presented when G is either the forest whose components are stars of order at least three or the complete bipartite graph whose partite sets consist of at least two vertices. The edge-strength of a graph G is the strength of the line graph of G, and thus this work extends the known results about the edge-strength and strength of graphs.
Publication Details
Page(s) 22-25
Published Journal: Discrete Mathematics Letters, Volume: 12, Issue: 0, Year: 2023

Request the full text from PASTIC

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

Citations

0

Downloads

24

Views