Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/699
DC FieldValueLanguage
dc.contributor.authorAlazemi, Abdullahen_US
dc.contributor.authorAnđelić, Milicaen_US
dc.contributor.authorKoledin, Tamaraen_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:08Z-
dc.date.available2022-08-15T15:00:08Z-
dc.date.issued2021-01-01-
dc.identifier.issn03081087en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/699-
dc.description.abstractWe prove that for two graph classes, threshold graphs and chain graphs, there exist intervals in which their distance matrix does not have any eigenvalues. We also compute the determinant of the distance matrix of both threshold and chain graphs in terms of their generating binary sequence. In this way we positively address a research problem posed in [D.P. Jacobs, V. Trevisan, F. C. Tura, Distance eigenvalue location in thresholds graphs, Proceedings of DGA, Manaus; 2013. p. 1–4].en_US
dc.language.isoenen_US
dc.publisherTaylor and Francisen_US
dc.relation.ispartofLinear and Multilinear Algebraen_US
dc.subjectchain graphen_US
dc.subjectDistance matrixen_US
dc.subjecteigenvalue-free intervalen_US
dc.subjecttreshold graphen_US
dc.titleEigenvalue-free intervals of distance matrices of threshold and chain graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/03081087.2019.1701624-
dc.identifier.scopus2-s2.0-85076445864-
dc.identifier.isi000501971800001-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85076445864-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0308-1087en_US
dc.description.rankM21en_US
dc.relation.firstpage2959en_US
dc.relation.lastpage2975en_US
dc.relation.volume69en_US
dc.relation.issue16en_US
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
item.grantfulltextnone-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

21
checked on Mar 29, 2025

Page view(s)

21
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.