A tree whose complement is not eigensharp

DOI10.1016/S0024-3795(99)00253-0MaRDI QIDQ1971045zbMATH OpenFDO

Authors 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

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

Recommendations

• On eigensharp and almost eigensharp graphs
• The biclique partition number of some important graphs
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• On eigensharpness and almost eigensharpness of lexicographic products of some graphs
• Multicolored forests in bipartite decompositions of graphs

Cites work

• scientific article; zbMATH DE number 790476 (Why is no real title available?)
• Biclique decompositions and Hermitian rank
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• Eigenvalue inequalities and equalities
• Graph theory
• On biclique decompositions of complete \(t\)-partite graphs
• On the Addressing Problem for Loop Switching
• On the decomposition ofkn into complete bipartite graphs

Cited in

(6)

• On eigensharp and almost eigensharp graphs
• The biclique partition number of some important graphs
• On eigensharpness and almost eigensharpness of lexicographic products of some graphs
• Eigensharp property of some certain graphs and their complements
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• Inertia and biclique decompositions of joins of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1971045)