Some New Results on the Edge-Strength and Strength of Graphs
Rikio Ichishima, Akito Oshima, Yukio Takahashi · Discrete Mathematics Letters · 2023
An edge numbering f of a graph G of size m is a labeling that assigns distinct elements of the set {1, 2, . . ., m} to the edges of G.The edge-strength estrIn 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.