DC FieldValueLanguage
dc.contributor.authorStevanović, Draganen
dc.date.accessioned2020-05-01T20:13:07Z-
dc.date.available2020-05-01T20:13:07Z-
dc.date.issued1999-11-01en
dc.identifier.issn0024-3795en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1318-
dc.description.abstractWe give the sufficient and necessary condition for the connectedness of non-complete extended p-sum (NEPS) of connected graphs, and we find the number of components of NEPS when it is disconnected. We show that the components of NEPS are mutually isomorphic and isomorphic to NEPS of the same non-bipartite factors and several copies of K2 in the case that K2 is the only bipartite factor of NEPS.en
dc.publisherElsevier-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectComposition of graphs | Connectivity | NEPS of graphs | Number of componentsen
dc.titleWhen is NEPS of graphs connected?en
dc.typeArticleen
dc.identifier.doi10.1016/S0024-3795(99)00194-9en
dc.identifier.scopus2-s2.0-0033259813en
dc.relation.firstpage137en
dc.relation.lastpage144en
dc.relation.issue1-3en
dc.relation.volume301en
dc.description.rankM22-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
crisitem.author.orcid0000-0003-2908-305X-
Show simple item record

SCOPUSTM   
Citations

10
checked on Sep 7, 2024

Page view(s)

1
checked on Sep 7, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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