Decomposition of product graphs into complete bipartite subgraphs

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Let τ(G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G. Let G n be the weak product of cliques, K n 1 x...xK n 1 . This graph has vertices {x:0≤x i <n i }, with edges between those vectors that differ in each coordinate. Theorem: τ(G n ) = ∑Π |S|eveniε{lunate}S (n i -1). © 1985.

Cite

CITATION STYLE

APA

Reznick, B., Tiwari, P., & West, D. B. (1985). Decomposition of product graphs into complete bipartite subgraphs. Discrete Mathematics, 57(1–2), 189–193. https://doi.org/10.1016/0012-365X(85)90167-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free