Study on subgraphs and connected factors in graphs

• Project/Area Number: 19740057
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Single-year Grants
• Research Field: General mathematics (including Probability theory/Statistical mathematics)
• Research Institution: Shibaura Institute of Technology (2008-2010); Tokai University (2007)
• Principal Investigator: MATSUDA Haruhide (MATSUDA Haruide) Shibaura Institute of Technology, 工学部, 准教授 (00333237)
• Project Period (FY): 2007 – 2010
• Project Status: Completed (Fiscal Year 2010)
• Budget Amount: ¥2,550,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥450,000); Fiscal Year 2010: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000); Fiscal Year 2009: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000); Fiscal Year 2008: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000); Fiscal Year 2007: ¥600,000 (Direct Cost: ¥600,000)
• Keywords: グラフ / グラフ理論 / 全域木 / 木 / 因子 / 部分グラフ / 次数条件 / 連結因子 / 正則因子 / 応用数学 / 離散数学

Research Abstract

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 connected factor. For these purposes, some results are obtained in this research.

Research Products

• [Journal Article] Degree conditions and degree bounded trees (2009)
  • Author(s): H.Matsuda, H.Matsumura
  • Journal Title: Discrete Mathematics 309 Pages: 3653-3658
• [Journal Article] Degree conditions and degree bounded trees (2009)
  • Author(s): H. Matsuda, H. Matsumura
  • Journal Title: Discrete Mathematics 309 Pages: 3653-3658
  • Peer Reviewed
• [Journal Article] On a spanning tree with specified leaves (2008)
  • Author(s): Y.Egawa, H.Matsuda, T.Yamashita, K.Yoshimoto
  • Journal Title: Graphs and Combinatorics 24 Pages: 13-18
• [Journal Article] On a spanning tree with specified leaves (2008)
  • Author(s): Y. Egawa, H. Matsuda, T. Yamashita, K. Yoshimoto
  • Journal Title: Graphs and Combinatorics 24 Pages: 13-18
  • Peer Reviewed
• [Journal Article] On a Spanning Tree with Specified Leaves (2008)
  • Author(s): Y., Egawa・H., Matsuda・T., Yamashita・K., Ybshimoto
  • Journal Title: Graphs and Combinatorics 24 Pages: 13-18
  • Peer Reviewed
• [Presentation] 連結因子の次数条件について (2008)
  • Author(s): 松田晴英
  • Organizer: RIMS共同研究「次数条件と因子が支配するグラフの幾何と解析」
  • Place of Presentation: 京都大学
  • Year and Date: 2008-10-03
• [Presentation] A degree condition for a bipartite graph to have a regular factor (2008)
  • Author(s): 松田晴英
  • Organizer: 純粋数学及び応用数学としての組合せ論離散数学そしてその周辺ワークショップ
  • Place of Presentation: 電気通信大学
  • Year and Date: 2008-07-04
• [Presentation] A degree condition for a bipartite graph to have a regular factor (2008)
  • Author(s): 松田晴英
  • Organizer: 純粋数学及び応用数学としての組合せ論・離散数学そしてその周辺ワークショップ
  • Place of Presentation: 電気通信大学
  • Year and Date: 2008-07-04
• [Presentation] A degree condition for a bipartite graph to have a regular factor (2007)
  • Author(s): H., Matsuda
  • Organizer: The Kyoto International Conference on Computational Geometry and Graph Theory (KyotoCGGT2007)
  • Place of Presentation: 京都大学
  • Year and Date: 2007-06-15
• [Remarks] ホームページ等
  • URL: http://www.sic.shibaura-it.ac.jp/~hmatsuda/
• [Remarks]
  • URL: http://www.sic.shibaura-it.ac.jp/~hmatsuda/
• [Remarks]
  • URL: http://www.sic.shibaura-it.ac.jp/~hmatsuda/
• [Remarks]
  • URL: http://www.sic.shibaura-it.ac.jp/~hmatsuda/
• [Remarks]
  • URL: http://www.sic.shibaura-itacjprhmatsuda/