Let G be a group. We consider the set cd（G）／{m}, where m ∈ cd（G）. We define the graph △（G - m） whose vertex set is p（G - m）, the set of primes dividing degrees in cd（G）／{m}. There is an edge between p an...Let G be a group. We consider the set cd（G）／{m}, where m ∈ cd（G）. We define the graph △（G - m） whose vertex set is p（G - m）, the set of primes dividing degrees in cd（G）／{m}. There is an edge between p and q in p（G - m） ifpq divides a degree a ∈ cd（G）／{m}. We show that if G is solvable, then △（G - m） has at most two connected components.展开更多
基金Supported by the National Natural Science Foundation of China (Grant No.10871032)Innovation Project for the Development of Science and Technology (IHLB) (Grant No.201098)the Specific Research Fund of the Doctoral Program of Higher Education of China (Grant No.20060285002)
文摘Let G be a group. We consider the set cd（G）／{m}, where m ∈ cd（G）. We define the graph △（G - m） whose vertex set is p（G - m）, the set of primes dividing degrees in cd（G）／{m}. There is an edge between p and q in p（G - m） ifpq divides a degree a ∈ cd（G）／{m}. We show that if G is solvable, then △（G - m） has at most two connected components.
