A characterization of graphs with rank 4

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

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

题名:	A characterization of graphs with rank 4
作者:	Chang,GJ;Huang,LH;Yeh,HG
贡献者:	數學系
关键词:	MOLECULAR-ORBITALS;SINGULAR GRAPHS;NULLITY;TREES
日期:	2011
上传时间:	2012-03-27 18:24:03 (UTC+8)
出版者:	國立中央大學
摘要:	The rank of a graph G is defined to be the rank of its adjacency matrix. In this paper, we consider the following problem: What is the structure of a connected graph with rank 4? This question has not yet been fully answered in the literature, and only some partial results are known. In this paper we resolve this question by completely characterizing graphs G whose adjacency matrix has rank 4. (C) 2010 Elsevier Inc. All rights reserved.
關聯:	LINEAR ALGEBRA AND ITS APPLICATIONS
显示于类别:	[數學系] 期刊論文

文件中的档案:

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

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

社群 sharing