Some notes on graphs whose index is close to 2

DC Field	Value	Language
dc.contributor.author	Belardo, Francesco	en
dc.contributor.author	Li Marzi, Enzo Maria	en
dc.contributor.author	Simić, Slobodan	en
dc.date.accessioned	2020-05-01T20:12:50Z	-
dc.date.available	2020-05-01T20:12:50Z	-
dc.date.issued	2007-05-01	en
dc.identifier.issn	0024-3795	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1169	-
dc.description.abstract	We consider two classes of graphs: (i) trees of order n and diameter d =n - 3 and (ii) unicyclic graphs of order n and girth g = n - 2. Assuming that each graph within these classes has two vertices of degree 3 at distance k, we order by the index (i.e. spectral radius) the graphs from (i) for any fixed k (1 ≤ k ≤ d - 2), and the graphs from (ii) independently of k.	en
dc.relation	Elsevier	-
dc.relation	Serbian Ministry of Sciences, Project 144015G	-
dc.relation.ispartof	Linear Algebra and Its Applications	en
dc.subject	Characteristic polynomial \| Diameter \| Index \| Tree \| Unicyclic graph	en
dc.title	Some notes on graphs whose index is close to 2	en
dc.type	Article	en
dc.identifier.doi	10.1016/j.laa.2006.09.009	en
dc.identifier.scopus	2-s2.0-33947242812	en
dc.relation.firstpage	81	en
dc.relation.lastpage	89	en
dc.relation.issue	1	en
dc.relation.volume	423	en
dc.description.rank	M22	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.cerifentitytype	Publications	-
item.fulltext	No Fulltext	-
item.grantfulltext	none	-

6

checked on Nov 23, 2024

19

checked on Nov 24, 2024

Check