A (FORGOTTEN) UPPER BOUND FOR THE SPECTRAL RADIUS OF A GRAPH
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1602 | en_US |
dc.citation.spage |
1593 | en_US |
dc.citation.volume |
19 | en_US |
dc.citation.woscount |
0 | en_US |
dc.contributor.author |
Elphick, Clive | en_US |
dc.contributor.author |
Liu, Chia-An | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2016-03-28T00:04:27Z | |
dc.date.available |
2016-03-28T00:04:27Z | |
dc.date.issued |
2015-12-01 | en_US |
dc.description.abstract |
The best degree-based upper bound for the spectral radius is due to Liu and Weng. This paper begins by demonstrating that a (forgotten) upper bound for the spectral radius dating from 1983 is equivalent to their much more recent bound. This bound is then used to compare lower bounds for the clique number. A series of line graph degree-based upper bounds for the Q-index is then proposed and compared experimentally with a graph based bound. Finally a new lower bound for generalised r-partite graphs is proved, by extending a result due to Erdos. | en_US |
dc.identifier.issn |
1027-5487 | en_US |
dc.identifier.journal |
TAIWANESE JOURNAL OF MATHEMATICS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/129714 | |
dc.identifier.wosnumber |
WOS:000369255600003 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Graph | en_US |
dc.subject |
Spectral radius | en_US |
dc.subject |
Q-index | en_US |
dc.subject |
Clique number | en_US |
dc.title |
A (FORGOTTEN) UPPER BOUND FOR THE SPECTRAL RADIUS OF A GRAPH | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文