When can the components of NEPS of connected bipartite graphs be almost cospectral?

DOI10.1016/S0024-3795(00)00061-6zbMath0953.05044MaRDI QIDQ1567543

Dragan Stevanović

Publication date: 29 August 2000

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

cospectralconnected bipartite graphsnon-complete extended \(p\)-sum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

A few examples and counterexamples in spectral graph theory ⋮ On the components of NEPS of connected bipartite graphs

Cites Work

• When is NEPS of graphs connected?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: When can the components of NEPS of connected bipartite graphs be almost cospectral?