Témavezetés adatlap
KAREEM HUSSEIN AL-JANABI HANEEN
hallgató
témavezetés címe
Algebraic aspects of graphs (Chromatic polynomials and zero divisor graphs)
doktori iskola
témavezető
témavezetés módja
egyéni
fokozat típusa
PhD
témavezetés leírása
Graph coloring is a theoretical but very important tool in Operations Research. This is the common subject in the two different directions of research.
Chromatic polyniomials (ChP) yield a useful algebraic approach to coloring of graphs. Many difficult problems can be formulated by them in the field.
The aim of this reaserach is:
--- To determine the ChP of some special types of graphs (generalized wheels, among others).
--- Searching for relationships of the ChP with the induced subgraphs.
From any ring, its zero divisor graph can be constructed. While investigating this auxialiary graph, surprizing properties have been appeared. A thorough connection seems to link the clique number and the chromatic number in graphs obtained this way.
The main target of research here is to prove or disprove this connection.
képzés kezdete
2018-02-01
abszolutórium megszerzésének ideje
2022-01-01
státusz
fokozatot szerzett
témakiírás
doktori védés
értekezés címe
doktori védés időpontja
2023-02-02 12:00
fokozat odaítélésének dátuma
2023-02-23