Some notes on the threshold graphs

DC Field	Value	Language
dc.contributor.author	Anđelić, Milica	en
dc.contributor.author	Simić, Slobodan	en
dc.date.accessioned	2020-05-01T20:12:48Z	-
dc.date.available	2020-05-01T20:12:48Z	-
dc.date.issued	2010-09-28	en
dc.identifier.issn	0012-365X	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1146	-
dc.description.abstract	In this paper we consider threshold graphs (also called nested split graphs) and investigate some invariants of these graphs which can be of interest in bounding the largest eigenvalue of some graph spectra.	en
dc.publisher	Elsevier	-
dc.relation	FCT-Fundação para a Ciência e a Tecnologia, Grant SFRH/BD/ 44606/2008	-
dc.relation	Serbian Ministry for Science, Grant 144015G	-
dc.relation.ispartof	Discrete Mathematics	en
dc.subject	Adjacency matrix \| Largest eigenvalue \| Line graph \| Nested split graph \| Signless Laplacian \| Threshold graph	en
dc.title	Some notes on the threshold graphs	en
dc.type	Article	en
dc.identifier.doi	10.1016/j.disc.2010.04.022	en
dc.identifier.scopus	2-s2.0-77954177321	en
dc.contributor.affiliation	Mathematical Institute of the Serbian Academy of Sciences and Arts	-
dc.relation.firstpage	2241	en
dc.relation.lastpage	2248	en
dc.relation.issue	17-18	en
dc.relation.volume	310	en
dc.description.rank	M22	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
item.cerifentitytype	Publications	-
item.openairetype	Article	-

21

checked on Feb 3, 2025

18

checked on Jan 31, 2025

Check