On the index of necklaces

DC Field	Value	Language
dc.contributor.author	Belardo, Francesco	en
dc.contributor.author	Li Marzi, Enzo	en
dc.contributor.author	Simić, Slobodan	en
dc.contributor.author	Wang, Jianfeng	en
dc.date.accessioned	2020-05-01T20:12:49Z	-
dc.date.available	2020-05-01T20:12:49Z	-
dc.date.issued	2010-03-01	en
dc.identifier.issn	0911-0119	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1155	-
dc.description.abstract	We consider the following two classes of simple graphs: open necklaces and closed necklaces, consisting of a finite number of cliques of fixed orders arranged in path-like pattern and cycle-like pattern, respectively. In these two classes we determine those graphs whose index (the largest eigenvalue of the adjacency matrix) is maximal.	en
dc.publisher	Springer Link	-
dc.relation.ispartof	Graphs and Combinatorics	en
dc.subject	Adjacency spectrum \| Caterpillars \| Largest eigenvalue \| Line graphs \| Signless Laplacian spectrum \| Unicyclic graphs	en
dc.title	On the index of necklaces	en
dc.type	Article	en
dc.identifier.doi	10.1007/s00373-010-0910-4	en
dc.identifier.scopus	2-s2.0-77953325848	en
dc.contributor.affiliation	Mathematical Institute of the Serbian Academy of Sciences and Arts	-
dc.relation.firstpage	163	en
dc.relation.lastpage	172	en
dc.relation.issue	2	en
dc.relation.volume	26	en
dc.description.rank	M23	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.cerifentitytype	Publications	-
item.fulltext	No Fulltext	-
item.grantfulltext	none	-

3

checked on Nov 23, 2024

13

checked on Nov 24, 2024

Check