When is NEPS of graphs connected?

DC Field	Value	Language
dc.contributor.author	Stevanović, Dragan	en
dc.date.accessioned	2020-05-01T20:13:07Z	-
dc.date.available	2020-05-01T20:13:07Z	-
dc.date.issued	1999-11-01	en
dc.identifier.issn	0024-3795	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1318	-
dc.description.abstract	We 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.publisher	Elsevier	-
dc.relation.ispartof	Linear Algebra and Its Applications	en
dc.subject	Composition of graphs \| Connectivity \| NEPS of graphs \| Number of components	en
dc.title	When is NEPS of graphs connected?	en
dc.type	Article	en
dc.identifier.doi	10.1016/S0024-3795(99)00194-9	en
dc.identifier.scopus	2-s2.0-0033259813	en
dc.relation.firstpage	137	en
dc.relation.lastpage	144	en
dc.relation.issue	1-3	en
dc.relation.volume	301	en
dc.description.rank	M22	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.grantfulltext	none	-
item.openairetype	Article	-
item.fulltext	No Fulltext	-
crisitem.author.orcid	0000-0003-2908-305X	-

13

checked on Jan 29, 2026

76

checked on Jan 29, 2026

Check