Resolution of AutoGraphiX conjectures relating the index and matching number of graphs

DC Field	Value	Language
dc.contributor.author	Stevanović, Dragan	en
dc.date.accessioned	2020-05-01T20:13:01Z	-
dc.date.available	2020-05-01T20:13:01Z	-
dc.date.issued	2010-12-15	en
dc.identifier.issn	0024-3795	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1268	-
dc.description.abstract	We resolve conjectures of AutoGraphiX relating the index and the matching number of connected graphs.	en
dc.publisher	Elsevier	-
dc.relation	Serbian Ministry of Science and Technological Development, Grant 144015G	-
dc.relation	Slovenian Research Agency, Program P1-0285	-
dc.relation.ispartof	Linear Algebra and Its Applications	en
dc.subject	AutoGraphiX \| Conjecture \| Matching number \| Spectral radius	en
dc.title	Resolution of AutoGraphiX conjectures relating the index and matching number of graphs	en
dc.type	Article	en
dc.identifier.doi	10.1016/j.laa.2010.06.015	en
dc.identifier.scopus	2-s2.0-77956392792	en
dc.relation.firstpage	1674	en
dc.relation.lastpage	1677	en
dc.relation.issue	8-10	en
dc.relation.volume	433	en
dc.description.rank	M22	-
item.fulltext	No Fulltext	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
crisitem.author.orcid	0000-0003-2908-305X	-

7

checked on Apr 2, 2025

24

checked on Jan 31, 2025

Check