A CONNECTED GRAPH IS PATH-POSITIVE IFF ITS SPECTRAL RADIUS IS AT LEAST TWO  

A CONNECTED GRAPH IS PATH-POSITIVE IFF ITS SPECTRAL RADIUS IS AT LEAST TWO

在线阅读下载全文

作  者:SHI Ronghua(Department of Applied Mathematics, Nanjing University of Science and Technology,Nanjing 210014, China) 

出  处:《Systems Science and Mathematical Sciences》1996年第4期319-325,共7页

摘  要:ACONNECTEDGRAPHISPATH-POSITIVEIFFITSSPECTRALRADIUSISATLEASTTWO¥SHIRonghua(DepartmentofAppliedMathematics,NanjingUniversityofS...The main purpose of this paper is to prove that a connected graph is pathpositive if and only if its spectral radius is at least two.

关 键 词:Matrix CONNECTED graph characteristic POLYNOMIAL spectral radius. 

分 类 号:O157.5[理学—数学]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象