On Graphs, Even graphs and interaction between minimum degree and connectivity
| Project/Area Number |
18540142
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
General mathematics (including Probability theory/Statistical mathematics)
|
|---|
| Research Institution | Nihon University |
|---|
Principal Investigator |
YOSHIMOTO Kiyoshi (YOSHIMOTO Kiyoshl) Nihon University, 理工学部, 講師 (90307801)
|
|---|
| Project Period (FY) |
2006 – 2009
|
| Project Status |
Completed (Fiscal Year 2009)
|
| Budget Amount *help |
¥3,990,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2009: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2008: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2007: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2006: ¥1,000,000 (Direct Cost: ¥1,000,000)
|
|---|
| Keywords | 線グラフ / クローフリーグラフ / ハミルトンサイクル / 2因子 / 偶グラフ / Claw-free graph / line graph / 独立点集合 / 連結度 / Claw-freegraph / hami1ton cycle / Hamilton cycle / グラフ理論 / claw-free graph / Ore型条件 / 最小次数 / 独立店集合 / claw-freeグラフ |
|---|
| Research Abstract |
The existence of 2-factors of claw-free graphs can be determined by minimum degree condition without connectivity. In this research, by using Ryjacek closure, we replace problems on 2-factors in claw-free graphs with 2-factors of line graphs or the preimage graphs and analyzed structures of claw-free graphs.
|
Report
(6 results)
Research Products
(57 results)
