On minimum rank and zero forcing sets of a graph

NCU Institutional Repository > 理學院 > 數學系 > 期刊論文 > Item 987654321/51141

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51141

题名:	On minimum rank and zero forcing sets of a graph
作者:	Huang,LH;Chang,GJ;Yeh,HG
贡献者:	數學系
关键词:	SYMMETRIC-MATRICES
日期:	2010
上传时间:	2012-03-27 18:23:02 (UTC+8)
出版者:	國立中央大學
摘要:	For a graph G on n vertices and a field F. the minimum rank of G over F, written as mr(F)(G), is the smallest possible rank over all n x n symmetric matrices over F whose (i, j)th entry (for i not equal j) is nonzero whenever ij is an edge in G and is zero otherwise. The maximum nullity of G over F is M(F)(G) = n - mr(F)(G). The minimum rank problem of a graph G is to determine mr(F)(G) (or equivalently, M(F) (G)). This problem has received considerable attention over the years. In [F. Barioli, W. Barrett, S. Butler, S.M. Cioaba, D. Cvetkovic S.M. Fallat, C. Godsil, W. Haemers, L Hogben, R. Mikkelson, S. Narayan, O. Pryporova, I. Sciriha, W. So, D. Stevanovic, H. van der Holst, K.V. Meulen, A.W. Wehe, AIM Minimum Rank-Special Graphs Work Group, Zero forcing sets and the minimum rank of graphs, Linear Algebra Appl. 428 (2008) 1628-1648], a new graph parameter Z(G), the zero forcing number, was introduced to bound M(F) (G) from above. The authors posted an attractive question: What is the class of graphs G for which Z(G) = M(F) (G) for some field F? This paper focuses on exploring the above question. (C) 2010 Elsevier Inc. All rights reserved.
關聯:	LINEAR ALGEBRA AND ITS APPLICATIONS
显示于类别:	[數學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	373	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing