Access the full text.
Sign up today, get DeepDyve free for 14 days.
Carlo Casolo, S. Dolfi, E. Pacifici, Lucia Sanus (2013)
Incomplete vertices in the prime graph on conjugacy class sizes of finite groupsJournal of Algebra, 376
A. Moretó (2021)
Huppert's conjecture for character codegreesMathematische Nachrichten, 294
D. Gorenstein, J. Walter (1962)
On finite groups with dihedral Sylow 2-subgroupsIllinois Journal of Mathematics, 6
M. Herzog (1968)
On finite simple groups of order divisible by three primes onlyJournal of Algebra, 10
D. Gorenstein, J. Walter (1965)
The characterization of finite groups with dihedral Sylow 2-subgroups. I☆Journal of Algebra, 2
R Bahramian, N Ahanjideh (2021)
p\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p$$\end{document}-parts of co-degrees of irreducible charactersC. R. Math., 359
N. Ahanjideh (2020)
The Fitting subgroup, p‐length, derived length and character tableMathematische Nachrichten, 294
D Gorenstein, JH Walter (1962)
On finite groups with dihedral Sylow 2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2$$\end{document}-subgroupsIll. J. Math., 6
Guohua Qian (2021)
Element orders and character codegreesBulletin of the London Mathematical Society, 53
Guohua Qian, Yanming Wang, Huaquan Wei (2007)
Co-degrees of irreducible characters in finite groups☆Journal of Algebra, 312
N. Ahanjideh (2022)
Finite groups admitting at most two irreducible characters having equal co-degreesJournal of Algebra and Its Applications
D. Gorenstein, J. Walter (1964)
The characterization of nite groups with dihedral Sylow 2 - subgroupsJournal of Algebra
I. Isaacs (2011)
Element orders and character codegreesArchiv der Mathematik, 97
N. Ahanjideh (2021)
The one-prime hypothesis on the co-degrees of irreducible charactersCommunications in Algebra, 49
A. Moret'o (2021)
A dual version of Huppert's rho-sigma conjecture for character codegrees
A. Moretó (2022)
A dual version of Huppert's ρ-σ conjecture for character codegreesForum Mathematicum, 34
T. Keller (1995)
A Linear Bound for ρ(n)Journal of Algebra, 178
− 1 and hence, |π(G)| = (m + 1) < 2(m + 1), as wanted. Now, suppose that every vertex of (G) is incomplete. By Theorem B, G has the normal subgroups
Huan Xiong (2015)
Finite Groups Whose Character Graphs Associated with Codegrees Have No TrianglesarXiv: Group Theory
N. Ahanjideh (2021)
NONDIVISIBILITY AMONG IRREDUCIBLE CHARACTER CO-DEGREESBulletin of the Australian Mathematical Society, 105
R. Brauer, Michio Suzuki (1959)
ON FINITE GROUPS OF EVEN ORDER WHOSE 2-SYLOW GROUP IS A QUATERNION GROUP.Proceedings of the National Academy of Sciences of the United States of America, 45 12
M. Lewis, G. Navarro, D. Passman, T. Wolf (2010)
Character Theory of Finite Groups, 524
If t ∈ π(SL 2 ( p)), then Lemma 2.3(iii) and Corollary 2.2 force r and t to be adjacent in (G)
P. Cameron, N. Maslova (2020)
Criterion of unrecognizability of a finite group by its Gruenberg–Kegel graphJournal of Algebra
Guohua Qian (2011)
A note on element orders and character codegreesArchiv der Mathematik, 97
Therefore, |π(G)| = 6, as wanted
Peter Cameron, Michael Giudici, Gareth Jones, William Kantor, Mikhail Klin, D. Marušič (2019)
PERMUTATION GROUPSGroup Theory for Physicists
M. Lewis (2008)
An Overview of Graphs Associated with Character Degrees And Conjugacy Class Sizes in Finite GroupsRocky Mountain Journal of Mathematics, 38
D. White (2013)
Character degrees of extensions of PSL2(q) and SL2(q)Journal of Group Theory, 16
Roya Bahramian, N. Ahanjideh (2020)
$p$-DIVISIBILITY OF CO-DEGREES OF IRREDUCIBLE CHARACTERSBulletin of the Australian Mathematical Society, 103
Roya Bahramian, N. Ahanjideh (2021)
p-parts of co-degrees of irreducible charactersComptes Rendus Mathematique, 359
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
Let G be a finite group. For an irreducible character χ\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\chi $$\end{document} of G, the number χc(1)=[G:kerχ]χ(1)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\chi ^c(1)=\frac{[G:\mathrm{ker}\chi ]}{\chi (1)}$$\end{document} is called the co-degree of χ\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\chi $$\end{document}. Let Codeg(G)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\mathrm{Codeg}(G)$$\end{document} denote the set of co-degrees of the irreducible (complex) characters of G. The co-degree graph of G is defined as the simple undirected graph whose vertices are prime divisors of the numbers in Codeg(G)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\mathrm{Codeg}(G)$$\end{document} and two distinct vertices p and q are joined by an edge if and only if pq divides some number in Codeg(G)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\mathrm{Codeg}(G)$$\end{document}. In this paper, we first study the finite non-solvable groups whose co-degree graphs have no complete vertices. Then, we show that if the co-degree graph of G has no complete vertices, then for every x∈G\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$x \in G$$\end{document}, G admits an irreducible character whose co-degree is divisible by o(x), the order of x. Finally, we inspect the finite groups whose co-degree graphs are m-regular.
Bulletin of the Malaysian Mathematical Sciences Society – Springer Journals
Published: Sep 1, 2022
Keywords: The co-degree of a character; Co-degree graph; Order element; Complete vertex; 20C15; 20D10; 20D60
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.