A characterization of graphs with rank 4

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

Title:	A characterization of graphs with rank 4
Authors:	Chang,GJ;Huang,LH;Yeh,HG
Contributors:	數學系
Keywords:	MOLECULAR-ORBITALS;SINGULAR GRAPHS;NULLITY;TREES
Date:	2011
Issue Date:	2012-03-27 18:24:03 (UTC+8)
Publisher:	國立中央大學
Abstract:	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.
Relation:	LINEAR ALGEBRA AND ITS APPLICATIONS
Appears in Collections:	[Department of Mathematics] journal & Dissertation

Files in This Item:

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

社群 sharing