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

I need to split graph, another say to color it into some groups of unadjacent edges.

Minimize number of groups is not the only goal to achive. Group of every size has its's own weight, e.g. 64 - 1, 128 - 1.5, 256 - 1.8 and so on. If we have got some groups then weight of coloring is the weight of its biggest component. And i need somehow to minimize $NumOfGroups * WeightOfColoring$.

I'm not very strong in graph theory, but it would be good if you direct me to a good article or give me a good hint.

share|cite|improve this question
This may give you good hints and some references also I think. – wece Jul 24 '13 at 15:29

I guess what you need to start from are Hosoya index and matching polynomials.

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.