Authors: Stevanović, Dragan 
Title: When is NEPS of graphs connected?
Journal: Linear Algebra and Its Applications
Volume: 301
Issue: 1-3
First page: 137
Last page: 144
Issue Date: 1-Nov-1999
Rank: M22
ISSN: 0024-3795
DOI: 10.1016/S0024-3795(99)00194-9
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: Composition of graphs | Connectivity | NEPS of graphs | Number of components
Publisher: Elsevier

Show full item record

SCOPUSTM   
Citations

10
checked on May 18, 2024

Page view(s)

32
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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