| Budget Amount *help |
¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
Fiscal Year 2018: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2017: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2016: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2015: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2014: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Outline of Final Research Achievements |
The original aim was to characterize classical distance-regular completely regular clique graphs satisfying the thin condition.
1. We clarified the structure of distance-regular completely regular clique graphs and established a way to determine whether the known distance-regular graphs with large diameter to have structures of completely regular clique graphs. It enabled us to determine completely regular clique graph structures, i.e., the choices of C, of all known families of distance-regular graphs with unbounded diameter.
2. We studied the universal C-cover of the associated distance-semiregular graphs and gave a finiteness condition of the universal C-cover when C is the collection of closed circuits of minimal length.
|
