Приказ основних података о документу
The maximum number of P-vertices of some nonsingular double star matrices
dc.creator | Erić, Aleksandra Lj. | |
dc.creator | da Fonseca, Carlos | |
dc.date.accessioned | 2023-09-27T10:42:56Z | |
dc.date.available | 2023-09-27T10:42:56Z | |
dc.date.issued | 2013 | |
dc.identifier.issn | 0012-365X | |
dc.identifier.issn | 1872-681X | |
dc.identifier.uri | https://grafar.grf.bg.ac.rs/handle/123456789/3174 | |
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. | sr |
dc.language.iso | en | sr |
dc.rights | openAccess | sr |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | |
dc.source | Discrete Mathematics | sr |
dc.subject | Graphs Matrices Eigenvalues Double stars P-vertices | sr |
dc.title | The maximum number of P-vertices of some nonsingular double star matrices | sr |
dc.type | article | sr |
dc.rights.license | BY-NC-ND | sr |
dc.citation.rank | M22 | |
dc.citation.volume | 313 (20) 2192-2194 | |
dc.identifier.doi | 10.1016/j.disc.2013.05.018 | |
dc.identifier.fulltext | http://grafar.grf.bg.ac.rs/bitstream/id/11992/bitstream_11992.pdf | |
dc.type.version | publishedVersion | sr |