Author： Paolo Morresi Zuccari Claudio
Publisher： Taylor & Francis Ltd
ISSN： 0092-7872
Source： Communications in Algebra, Vol.41, Iss.8, 2013-08, pp. : 2869-2878
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Let a graph Γ have bounded Fitting height (i.e., there is a bound on the Fitting heights of those groups whose character degree graph is Γ) and G be any solvable group with character degree graph Γ and Fitting height h(G). We improve Moretò's bound by proving that if no vertex in Γ is adjacent to every other one, then h(G) ≤4, else h(G) ≤6. As a consequence, if a solvable group G has character degree graph with diameter 3, then h(G) ≤4. Moreover, G has at most one non-abelian normal Sylow subgroup in this case.
Related content
Fitting Height and Character Degree Graphs
Algebras and Representation Theory, Vol. 10, Iss. 4, 2007-08 ,pp. :
Access to resources
Recommend
ON THE DEGREE DISTANCE OF SOME COMPOSITE GRAPHS
Bulletin of the Australian Mathematical Society, Vol. 85, Iss. 1, 2012-02 ,pp. :
Saturated Graphs of Prescribed Minimum Degree
Combinatorics, Probability & Computing, Vol. 26, Iss. 2, 2017-03 ,pp. :
On the spectral radius of tricyclic graphs with a fixed diameter
Linear and Multilinear Algebra, Vol. 59, Iss. 1, 2011-01 ,pp. :
Strong-Diameter Decompositions of Minor Free Graphs
Theory of Computing Systems, Vol. 47, Iss. 4, 2010-11 ,pp. :