A (FORGOTTEN) UPPER BOUND FOR THE SPECTRAL RADIUS OF A GRAPH

Simple item page
dc.citation.epage1602en_US
dc.citation.issue6en_US
dc.citation.spage1593en_US
dc.citation.volume19en_US
dc.contributor.authorElphick, Cliveen_US
dc.contributor.authorLiu, Chia-Anen_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.date.accessioned2017-04-21T06:55:47Z
dc.date.available2017-04-21T06:55:47Z
dc.date.issued2015-12en_US
dc.description.abstractThe 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.issn1027-5487en_US
dc.identifier.journalTAIWANESE JOURNAL OF MATHEMATICSen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/133558
dc.identifier.wosnumberWOS:000369255600003en_US
dc.language.isoen_USen_US
dc.subjectGraphen_US
dc.subjectSpectral radiusen_US
dc.subjectQ-indexen_US
dc.subjectClique numberen_US
dc.titleA (FORGOTTEN) UPPER BOUND FOR THE SPECTRAL RADIUS OF A GRAPHen_US

Files

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download

Collections

期刊論文;;Articles