Title of article
When is NEPS of graphs connected? Original Research Article
Author/Authors
Dragan Stevanoviimage، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
8
From page
137
To page
144
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.
Keywords
NEPS of graphs , connectivity , Composition of graphs , Number of components
Journal title
Linear Algebra and its Applications
Serial Year
1999
Journal title
Linear Algebra and its Applications
Record number
822845
Link To Document