Authors: Stevanović, Dragan 
Title: On the components of NEPS of connected bipartite graphs
Journal: Linear Algebra and Its Applications
Volume: 356
Issue: 1-3
First page: 67
Last page: 78
Issue Date: 15-Nov-2002
Rank: M22
ISSN: 0024-3795
DOI: 10.1016/S0024-3795(02)00322-1
Back in 1983, D. Cvetković posed the conjecture that the components of NEPS of connected bipartite graphs are almost cospectral. In 2000, we showed that this conjecture does not hold for infinitely many bases of NEPS, and we posed a necessary condition on the base of NEPS for NEPS to have almost cospectral components. At the same time, D. Cvetković posed weaker version of his original conjecture which claims that each eigenvalue of NEPS is also the eigenvalue of each component of NEPS. Here we prove this weaker conjecture, give an upper bound on the multiplicity of an eigenvalue of NEPS as an eigenvalue of its component, give new sufficient condition for the almost cospectrality of components of NEPS of connected bipartite graphs, and characterize the bases of NEPS which satisfy this condition.
Keywords: Components | Cospectrality | Eigenvalues | NEPS of graphs
Publisher: Elsevier

Show full item record


checked on Jun 23, 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.