The maximum number of P-vertices of some nonsingular double star matrices

dc.creator	Erić, Aleksandra
dc.creator	da Fonseca, C. M.
dc.date.accessioned	2019-04-19T14:20:20Z
dc.date.available	2019-04-19T14:20:20Z
dc.date.issued	2013
dc.identifier.issn	0012-365X
dc.identifier.uri	https://grafar.grf.bg.ac.rs/handle/123456789/530
dc.description.abstract	In this short note, we construct a nonsingular matrix A whose graph is a double star of order n >= 4 with n - 2 P-vertices. This example leads to a positive answer, for n >= 6, to a last open question proposed recently by Kim and Shader regarding the trees for which each nonsingular matrix has at most n 2 - P-vertices.	en
dc.publisher	Elsevier B.V.
dc.rights	restrictedAccess
dc.source	Discrete Mathematics
dc.subject	Graphs	en
dc.subject	Matrices	en
dc.subject	Eigenvalues	en
dc.subject	Double stars	en
dc.subject	P-vertices	en
dc.title	The maximum number of P-vertices of some nonsingular double star matrices	en
dc.type	article
dc.rights.license	ARR
dc.citation.epage	2194
dc.citation.issue	20
dc.citation.other	313(20): 2192-2194
dc.citation.rank	M22
dc.citation.spage	2192
dc.citation.volume	313
dc.identifier.doi	10.1016/j.disc.2013.05.018
dc.identifier.scopus	2-s2.0-84885185874
dc.identifier.wos	000323867400017
dc.type.version	publishedVersion