圖型與網路上零度、最小秩、擴散與著色問題的研究;A Study of Nullity Problems, Minimum Rank Problems, Diffusion Problems and Coloring Problems in Graphs

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/63172

Title:	圖型與網路上零度、最小秩、擴散與著色問題的研究;A Study of Nullity Problems, Minimum Rank Problems, Diffusion Problems and Coloring Problems in Graphs
Authors:	葉鴻國
Contributors:	國立中央大學數學系
Keywords:	數學
Date:	2012-12-01
Issue Date:	2014-03-17 14:20:49 (UTC+8)
Publisher:	行政院國家科學委員會
Abstract:	研究期間：10108~10207;The purpose of this project has three parts. In the first part, we study graph nullity problems and minimum rank problems. We focus on the following problems: 1. Give a complete characterization of graphs having rank 5. 2. Give a complete characterization of bipartite graphs having rank 6. 3. Study singular graphs. 4. Study η(L(T)), where L(T) is the line graph of tree T. 5. Study minimum rank and zero forcing number for Hamming graphs. 6. Study Delta Conjecture and Graph Complement Conjecture. 7. Study minimum rank of full patterns and its applications in communication complexity. In the second part, we study diffusion problem on social network. In the third part of the project, we deal with circular chromatic number and study Dichotomy Conjecture for Digraph Homomorphism and Dichotomy Conjecture for CSP
Relation:	財團法人國家實驗研究院科技政策研究與資訊中心
Appears in Collections:	[Department of Mathematics] Research Project

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	316	View/Open

社群 sharing