A note on universally optimal matrices and field independence of the minimum rank of a graph

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

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

题名:	A note on universally optimal matrices and field independence of the minimum rank of a graph
作者:	Huang,LH;Chang,GJ;Yeh,HG
贡献者:	數學系
关键词:	SYMMETRIC-MATRICES
日期:	2010
上传时间:	2012-03-27 18:22:21 (UTC+8)
出版者:	國立中央大學
摘要:	For a simple graph G on n vertices, the minimum rank of G over a field F, written as mr(F) (G), is defined to be the smallest possible rank among all n x n symmetric matrices over F whose (i, j)th entry (for i not equal j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. A symmetric integer matrix A such that every off-diagonal entry is 0, 1, or -1 is called a universally optimal matrix if, for all fields F, the rank of A over F is the minimum rank of the graph of A over F. Recently, Dealba et al. [L.M. Dealba, J. Grout, L Hogben, R. Mikkelson, K. Rasmussen, Universally optimal matrices and field independence of the minimum rank of a graph, Electron. J. Linear Algebra 18 (2009) 403-419] initiated the study of universally optimal matrices and established field independence or dependence of minimum rank for some families of graphs. In the present paper, more results on universally optimal matrices and field independence or dependence of the minimum rank of a graph are presented, and some results of Dealba et al. [5] are improved. (C) 2010 Elsevier Inc. All rights reserved.
關聯:	LINEAR ALGEBRA AND ITS APPLICATIONS
显示于类别:	[數學系] 期刊論文

文件中的档案:

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

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

社群 sharing