1-Connected character-graphs of finite groups with non-bipartite complement-Reference-Cited by-同舟云学术

1-Connected character-graphs of finite groups with non-bipartite complement

Published:2020-03-05 Issue:04 Volume:20 Page:2150058
ISSN:0219-4988
Container-title:Journal of Algebra and Its Applications
language:en
Short-container-title:J. Algebra Appl.

Author:

Ebrahimi Mahdi¹,Khatami Maryam²^ORCID,Mirzaei Zohreh²

Affiliation:

1. School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P. O. Box 19395-5746, Tehran, Iran

2. Department of Pure Mathematics, Faculty of Mathematics and Statistics, University of Isfahan, Isfahan, 81746-73441, Iran

Abstract

For a finite group [Formula: see text], let [Formula: see text] be the character-graph which is built on the set of irreducible complex character degrees of [Formula: see text]. In this paper, we wish to determine the structure of finite groups [Formula: see text] such that [Formula: see text] is [Formula: see text]-connected with nonbipartite complement. Also, we classify all [Formula: see text]-connected graphs with nonbipartite complement that can occur as the character-graph [Formula: see text] of a finite group [Formula: see text].

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Algebra and Number Theory

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0219498821500584

Reference17 articles.

1. On the character degree graph of solvable groups

2. Graph Theory

3. Hamiltonian character graphs

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-solvable Groups whose Character Degree Graph has a Cut-Vertex. I;Vietnam Journal of Mathematics;2023-06-21

2. Planar character-graphs;Communications in Algebra;2021-04-26