DC FieldValueLanguage
dc.contributor.authorStevanović, Draganen
dc.date.accessioned2020-05-01T20:13:07Z-
dc.date.available2020-05-01T20:13:07Z-
dc.date.issued2000-05-15en
dc.identifier.issn0024-3795en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1317-
dc.description.abstractWe disprove the conjecture of Cvetković posed in 1983 that the components of non-complete extended p-sum (NEPS) of connected bipartite graphs are almost cospectral (cf. D. Cvetković, Publ. Inst. Math. (Beograd) 33 (47) (1983) 29-33). However, we do find the necessary condition for the components to be almost cospectral and we conjecture that it is also the sufficient condition. In the last part of the paper, we are interested in the question when NEPS of bipartite graphs is itself bipartite.en
dc.publisherElsevier-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectBipartiteness of graphs | Component of graphs | Composition of graphs | Cospectrality of graphs | NEPSen
dc.titleWhen can the components of NEPS of connected bipartite graphs be almost cospectral?en
dc.typeArticleen
dc.identifier.doi10.1016/S0024-3795(00)00061-6en
dc.identifier.scopus2-s2.0-0034416479en
dc.relation.firstpage35en
dc.relation.lastpage44en
dc.relation.issue1-3en
dc.relation.volume311en
dc.description.rankM22-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-2908-305X-
Show simple item record

SCOPUSTM   
Citations

5
checked on Nov 24, 2024

Page view(s)

21
checked on Nov 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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