Paper Info
Title
Decomposition Of Product Graphs Into Complete Bipartite Subgraphs
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| even iϵS (n i −1)
Year
DOI
Venue
1985
10.1016/0012-365X(85)90167-0
DISCRETE MATHEMATICS
Field
DocType
Volume
Discrete mathematics,Complete bipartite graph,Graph,Combinatorics,Vertex (geometry),Bipartite graph,Matching (graph theory),Partition (number theory),Mathematics
Journal
57
Issue
ISSN
Citations 
1-2
0012-365X
3
PageRank 
References 
Authors
0.70
2
3
Name
Order
Citations
PageRank
Bruce Reznick1165.28
Prasoon Tiwari259296.81
Douglas B. West31176185.69