On biclique decompositions of complete \(t\)-partite graphs

DOI10.1016/0024-3795(94)00140-9zbMath0822.05055OpenAlexW1986700241WikidataQ126815381 ScholiaQ126815381MaRDI QIDQ1805302

Elizabeth D. Boyer, Bryan L. Shader

Publication date: 15 October 1995

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

Full work available at URL: https://doi.org/10.1016/0024-3795(94)00140-9

zbMATH Keywords

complete graphsGraham-Pollak theorembiclique decompositions

Mathematics Subject Classification ID

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

Related Items (4)

On a symmetric representation of Hermitian matrices and its applications to graph theory ⋮ Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs ⋮ A tree whose complement is not eigensharp ⋮ On eigensharp and almost eigensharp graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On biclique partitions of the complete graph
• A new proof of a theorem of Graham and Pollak
• Multicolored forests in bipartite decompositions of graphs
• How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?
• Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
• On the decomposition ofkn into complete bipartite graphs
• On the Addressing Problem for Loop Switching

This page was built for publication: On biclique decompositions of complete \(t\)-partite graphs