How can I get a random connected graph with m blocks so that each block is a k-clique (complete graph with k vertices).
| 1 | initial version |
How can I get a random connected graph with m blocks so that each block is a k-clique (complete graph with k vertices).
| 2 | retagged |
How can I get a random connected graph with m blocks so that each block is a k-clique (complete graph with k vertices).
| 3 | retagged |
How can I get a random connected graph with m blocks so that each block is a k-clique (complete graph with k vertices).
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.