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

SHI Ronghua

系统科学与复杂性(英文) ›› 1996, Vol. 9 ›› Issue (4) : 320-325.

PDF(205 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(205 KB)
系统科学与复杂性(英文) ›› 1996, Vol. 9 ›› Issue (4) : 320-325.
论文

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

    SHI Ronghua
Author information +
文章历史 +

本文亮点

{{article.keyPoints_cn}}

HeighLight

{{article.keyPoints_en}}

摘要

{{article.zhaiyao_cn}}

Abstract

{{article.zhaiyao_en}}

关键词

Key words

本文二维码

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
{{article.zuoZheCn_L}}. {{article.title_cn}}. {{journal.qiKanMingCheng_CN}}, 1996, 9(4): 320-325
{{article.zuoZheEn_L}}. {{article.title_en}}. {{journal.qiKanMingCheng_EN}}, 1996, 9(4): 320-325
中图分类号：

参考文献

原文顺序 | 文献年度倒序 | 文中引用次数倒序

参考文献

{{article.reference}}

基金

版权

{{article.copyrightStatement_cn}}
{{article.copyrightLicense_cn}}
PDF(205 KB)

Accesses

Citation

Detail
段落导航
相关文章

/

〈 〉