Authors: Stevanović, Dragan 
Title: When can the components of NEPS of connected bipartite graphs be almost cospectral?
Journal: Linear Algebra and Its Applications
Volume: 311
Issue: 1-3
First page: 35
Last page: 44
Issue Date: 15-May-2000
Rank: M22
ISSN: 0024-3795
DOI: 10.1016/S0024-3795(00)00061-6
We 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.
Keywords: Bipartiteness of graphs | Component of graphs | Composition of graphs | Cospectrality of graphs | NEPS
Publisher: Elsevier

Show full item record


checked on May 18, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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