Solvable groups whose degree graphs have two connected components

By M. Lewis. 2001

79 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/0ef89232bc5e2c42cb1593d7ba3a13199ecd4b73

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Huaquan Wei
2. Yanming Wang
3. D. L. White
4. A. Skiba
5. Wenbin Guo

In Discrete Mathematics and Combinatorics

1. Yanming Wang
2. Huaquan Wei
3. D. L. White
4. A. Skiba
5. Yangming Li
6. Wenbin Guo
7. Xiaoyu Chen
8. L. Miao

In Electrical and Electronic Engineering

1. Huaquan Wei
2. D. L. White
3. Yanming Wang
4. A. Skiba
5. Wenbin Guo

Citations in the corpus

• Co-degrees of irreducible characters in finite groups☆ (2007, background): “Recall that if G is a solvable group with disconnected degree graph, then nl(G) (the Fitting height of G) has upper bound 4, and if in addition nl(G) = 4 then G has a quotient group which is isomorphic to GL(2,3) (see [4]).”
• Connectedness of degree graphs of nonsolvable groups (2003, background): “3 with the results of [14] to obtain a classification of all groups G where ∆(G) has two connected components.”