@article {
author = {Hafezieh, Roghayeh},
title = {On nonsolvable groups whose prime degree graphs have four vertices and one triangle},
journal = {International Journal of Group Theory},
volume = {7},
number = {3},
pages = {1-6},
year = {2018},
publisher = {University of Isfahan},
issn = {2251-7650},
eissn = {2251-7669},
doi = {10.22108/ijgt.2017.21476},
abstract = {Let $G$ be a finite group. The prime degree graph of $G$, denoted by $\Delta(G)$, is an undirected graph whose vertex set is $\rho(G)$ and there is an edge between two distinct primes $p$ and $q$ if and only if $pq$ divides some irreducible character degree of $G$. In general, it seems that the prime graphs contain many edges and thus they should have many triangles, so one of the cases that would be interesting is to consider those finite groups whose prime degree graphs have a small number of triangles. In this paper we consider the case where for a nonsolvable group $G$, $\Delta(G)$ is a connected graph which has only one triangle and four vertices.},
keywords = {prime degree graph,irreducible character degree,triangle},
url = {https://ijgt.ui.ac.ir/article_21476.html},
eprint = {https://ijgt.ui.ac.ir/article_21476_7aa9bd067cc2235a1faa46dd8f4728af.pdf}
}