[Turkmath:5186] Gebze Teknik Üniversitesi Matematik Bölümü Genel Seminerleri

[GTU Mathematics]

Sayın Liste Üyeleri,

Gebze Teknik Üniversitesi (GTU) Matematik Bölümü Genel Seminerleri
kapsamında, 15 Ekim Cuma günü saat 14:00'da Dr. Hadi Alizadeh (Gebze Teknik
Üniversitesi, Türkiye) bir seminer verecektir. Seminerin detayları Aşağıda
olup tüm ilgilenenler davetlidir.

Saygılarımızla.

Dear all,

There will be a seminar in Gebze Technical University (GTU) on 15th of
October by Dr. Hadi Alizadeh (Gebze Teknik Üniversitesi, Turkey).

Time and place: At 14:00 in Department of Mathematics, Lecture Room 3

Title: On Domination Concept in Graph Theory

Abstract: Domination is a graph theory concept which has many applications
in computer science such as resource allocation and coding theory. A
dominating set in a graph 𝐺 is a set 𝑆 of vertices of 𝐺 such that every
vertex of 𝐺 is either in 𝑆 or is adjacent to a vertex in 𝑆. A dominating
set is minimal if it does not contain another dominating set. The first
part of this talk covers two special graph classes: well-dominated and
almost well-dominated graphs. While the term well-dominated was first
introduced by Finbow et al. [1] for the graphs whose minimal dominating
sets have the same cardinality, we introduce almost well-dominated graphs
as graphs with only two different sizes of minimal dominating sets, where
the difference between these two sizes is one. The second part of this talk
will be a discussion on a different variant of domination called paired
domination, which was put forward by Haynes and Slater [2].

[1] Finbow A., Hartnell B., Nowakowski R., (1988), “Well-dominated graphs:
a collection of well-covered ones”, Ars Combinatoria, 25, 5–10.

[2] Haynes T. W., Slater P. J., (1998), “Paired-domination in graphs”,
Networks, 32 (3), 199–206.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://yunus.listweb.bilkent.edu.tr/pipermail/turkmath/attachments/20211011/5fa1b558/attachment.html>