WEKO3
アイテム
近傍和と奇次数因子臨界グラフ
https://nakamura-u.repo.nii.ac.jp/records/703
https://nakamura-u.repo.nii.ac.jp/records/70352ffedae-fab5-4d70-b49c-6ac9ae5e3148
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
KJ00000735934.pdf (218.2 kB)
|
|
| アイテムタイプ | [ELS]紀要論文 / Departmental Bulletin Paper(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2017-03-14 | |||||
| タイトル | ||||||
| タイトル | 近傍和と奇次数因子臨界グラフ | |||||
| タイトル | ||||||
| タイトル | Neighborhood Unions and Odd Factor Critical Graphs | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
| 資源タイプ | departmental bulletin paper | |||||
| 雑誌書誌ID | ||||||
| 収録物識別子タイプ | NCID | |||||
| 収録物識別子 | AA1155311X | |||||
| 著者 |
松田, 晴英
× 松田, 晴英× Matsuda, Haruhide |
|||||
| 抄録(英) | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | Let n be an odd integer. A graph G is said to be m-factor-critical if G-H has a [1, n]-odd factor for each H⊂V(G) with |H|=m. In terms of neighborhood unions, we give a sufficient condition for a graph to be m-factor-critical with respect to [1, n]-odd factor. Let G be a k-connected graph. Let m be an integer with 0 ≤ m ≤ k and |G| ≡ m (mod 2), and let α be a real number with 1/(n+1) ≤ α ≤ 1. If |N_G(A)| > α(|G|-(n+1)k+nm-2)+k for every independent vertex set A of order [α(n(k-m)+2)], then G is m-factor-critical with respect to [1, n]-odd factor. We also discuss the sharpness of the result. x ∈ V(G), we denote by deg_G(x) the degree of x in G, and by N_G(x) the set of vertices adjacent to x in G. For a subset X ⊆ V(G), let N_G(X) = U_<x∈X>N_G(x). The number of odd components of odd in G is denoted by o(G). Let n be an odd integer. Then a spanning subgraph F of G is called a[1, n]-odd factor if deg_F(x) ∈{1, 3 ..., n} for all x ∈V(G). For a nonnegative integer m, a graph G is said to be m-factor-critical with respect to [1, n]-odd factor if G-H has a [1, n]-odd factor for each H ⊂ V(G) with |H| = m. Note that when n=1, [1, n]-odd factor nothing but 1-factor or perfect matching. Kano and Matsuda [3] introduce [1, n]-odd factor criticality, that is, it considers conditions for a proper subset of a graph to have a [1, n]-odd factor. One of results in the paper [3] is the following : | |||||
| 書誌情報 |
中村学園大学・中村学園大学短期大学部研究紀要 en : Bulletin of Nakamura Gakuen University and Nakamura Gakuen Junior College 巻 33, 発行日 2001-03-15 |
|||||
| 表示順 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | 30 | |||||
| アクセション番号 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | KJ00000735934 | |||||
| ISSN | ||||||
| 収録物識別子タイプ | ISSN | |||||
| 収録物識別子 | 13477331 | |||||
