A tree whose complement is not eigensharp

DOI10.1016/S0024-3795(99)00253-0zbMath0944.05078MaRDI QIDQ1971045

Valerie L. Watts

Publication date: 15 September 2000

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

zbMATH Keywords

biclique decompositioneigensharp graph

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Inertia and biclique decompositions of joins of graphs ⋮ On eigensharp and almost eigensharp graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Biclique decompositions and Hermitian rank
• Eigenvalue inequalities and equalities
• On biclique decompositions of complete \(t\)-partite graphs
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• On the decomposition ofkn into complete bipartite graphs
• On the Addressing Problem for Loop Switching

This page was built for publication: A tree whose complement is not eigensharp