| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2014: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2013: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Outline of Final Research Achievements |
A subgraph of a graph G is a graph if each of vetices belongs to the set of vertices in G and each of edges belongs to the edges in G. A factor of a graph is a spanning subgraph with some property. The main purposes of this research are the following : (1) We find mathematical structures in the specified subgraph of a graph, which is similar to those in the spanning subgraph of a graph. (2) We also find sufficient conditions for a graph to have some kinds of a tree in a graph. (3) We research trees with bounded degrees in the specified subgraph.
For these purposes, some results are obtained in this research.
|
