この論文をさがす
説明
An edge numbering f of a graph G of size q is a labeling that assigns distinct elements of the set [1, q] to the edges of G. The edge-strength estr (G) of G is estr (G) = min {estr_f (G) |f is an edge numbering of G } ,where estr_f (G) = max {f ( e_1 ) + f ( e_2 ) | e_1, e_2 are adjacent edges of G}. In this paper, we present several bounds for the edge-strength of a graph in terms of other invariants defined on graphs. We also introduce the concept of anti edge-strength aestr (G), and establish that estr (G) + aestr (G) = 2 ( q + 1) for a nonempty graph G of size q. This provides parallel bounds for aestr (G) to the ones on estr (G).
identifier:J-GLOBAL ID : 201801010867514825
identifier:VIAF ID : 113156009848949580850
identifier:J-GLOBAL ID : 201801010974794750
収録刊行物
-
- 国士舘大学紀要情報科学 = MEMOIRS OF THE KOKUSHIKAN UNIVERSITY INFORMATION SCIENCE
-
国士舘大学紀要情報科学 = MEMOIRS OF THE KOKUSHIKAN UNIVERSITY INFORMATION SCIENCE 41 9-15, 2020-03-20
国士舘大学全学教養教育運営センター情報科学部会