Mimar Sinan Fine Arts University Mathematics Department Seminars
On Nonsolvable Groups Whose Prime Degree Graphs Have Four Vertices and One Triangle
Roghayeh Hafizieh
Gebze Teknik Üniversitesi, Turkey
Özet :
There is a large literature which is devoted to study the ways in which
one can associate a graph with a group, for the purpose of investigating
the algebraic structure using properties of the associated graph. Let G
be a finite group. The prime degree graph of G, denoted by ∆(G), is an
undirected graph whose vertex set is ρ(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 talk we will consider the case where for
a nonsolvable group G, ∆(G) has only one triangle and four vertices.
|
Tarih |
: |
10.11.2016 |
|
Saat |
: |
16:00 |
|
Yer |
: |
Seminer Salonu |
|
Dil |
: |
English |