Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Was reading an introductory graph theory book, and it says that nets of solids can be represented using adjacency graphs, and new nets can be discovered by searching for all the spanning trees of the graph.

It also mentions that for some solids known as non-manifold, the spanning trees might not result in feasible nets. It does not elaborate.

I have tried searching this on the internet but it seems quite obscure and all I got were discussions about 3D graphic renderers

share|cite|improve this question
Does the book give definitions of feasible net and non-manifold solid? – Rahul Jan 11 '13 at 18:32

It is hart to say without the definitions, but it probably refers to the principle behind the following example. Consider two tretrahedra, which are glued at common vertex $v$. I would consider this solid as non-manifold. Any spanning tree has to contain $v$, hence if you cut your solid open at the spanning tree, the "net" is disconnected. And this is probably meant by infeasible.

Again, I am just guessing what the definitions could mean.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.