この論文をさがす
抄録
A numbering f of a graph G of order n is a labeling that assigns distinct elements of the set { 1, 2, . . . , n} to the vertices of G. The strength of G isstr (G) = min { str_f (G) |f is a numbering of G},where str_f (G) = max {f (u) + f (v) |uv ∈E (G) }. In this paper, we introduce the concept of anti-strength astr (G), and establish that str (G) + astr (G) = 2 (n + 1) for a nonempty graph G of order n. In addition, we show how the strength (or anti-strength) of a graph and other invariants defined on graphs are related.
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 1-8, 2020-03-20
国士舘大学全学教養教育運営センター情報科学部会
