| 言語種別 | 英語 |
|---|---|
| 発行・発表の年月 | 2024/03/17 |
| 形態種別 | 学術雑誌 |
| 査読 | 査読あり |
| 標題 | On the strength and independence number of powers of paths and cycles |
| 執筆形態 | 共著 |
| 掲載誌名 | Communications in Combinatorics and Optimization |
| 掲載区分 | 国外 |
| 出版社・発行元 | Azarbaijan Shahid Madani University |
| 巻・号・頁 | 1-12 |
| 総ページ数 | 12 |
| 担当区分 | 筆頭著者 , 責任著者 |
| 国際共著 | 国際共著 |
| 著者・共著者 | Rikio Ichishima, Francesc Antoni Muntaner-Batle and Yukio Takahashi |
| 原著者 | Azarbaijan Shahid Madani University |
| 概要 | 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 str (G) of G is defined by str (G) = min {strf (G) |f is a numbering of G}, where
strf (G) =max {f (u) + f (v) |uv ∈ E (G) }. Using the concept of independence number of a graph, we determine formulas for the strength of powers of paths and cycles. To achieve the latter result, we establish a sharp upper bound for the strength of a graph in terms of its order and independence number and a formula for the independence number of powers of cycles. |
| researchmap用URL | https://doi.org/10.22049/cco.2024.29087.1839 |