| 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). A CONNECTED GRAPH IS PATH-POSITIVE IFF ITS SPECTRAL RADIUS IS AT LEAST TWO[J]. 系统科学与复杂性, 1996, 0(4) |
| |
| 作者姓名： | SHI Ronghua(Department of Applied Mathematics Nanjing University of Science and Technology Nanjing 210014 China) |
| |
| 作者单位： | Department of Applied Mathematics，Nanjing University of Science and Technology，Nanjing 210014，China |
| |
| 摘 要： | ＡＣＯＮＮＥＣＴＥＤＧＲＡＰＨＩＳＰＡＴＨ－ＰＯＳＩＴＩＶＥＩＦＦＩＴＳＳＰＥＣＴＲＡＬＲＡＤＩＵＳＩＳＡＴＬＥＡＳＴＴＷＯ￥ＳＨＩＲｏｎｇｈｕａ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＮａｎｊｉｎｇＵｎｉｖｅｒｓｉｔｙｏｆＳ...
|
A CONNECTED GRAPH IS PATH-POSITIVE IFF ITS SPECTRAL RADIUS IS AT LEAST TWO |
| |
| SHI Ronghua. A CONNECTED GRAPH IS PATH-POSITIVE IFF ITS SPECTRAL RADIUS IS AT LEAST TWO[J]. Journal of Systems Science and Complexity, 1996, 0(4) |
| |
| Authors: | SHI Ronghua |
| |
| Abstract: | 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. |
| |
| Keywords: | Matrix connected graph characteristic polynomial spectral radius. |
| 本文献已被 CNKI 等数据库收录！ |
