[Turkmath:9553] Yıldız Teknik Üniversitesi Matematik Semineri Duyurusu (25 Şubat Salı)

[Ferhat Kürüz]

Değerli Liste Üyeleri,


Aşağıda detaylarını verdiğimiz 25 Şubat Salı günü YTÜ Matematik
Bölümünde verilecek 'Construction of Graph Designs with Prescribed
Automorphism Groups' başlıklı seminere
davetlisiniz. Konuşma İngilizce yapılacaktır.

Saygılarımla,
YTÜ Matematik Bölümü Seminer Koordinatörlüğü


Tarih: 25.02.2014
Saat:10:00
Yer: YTÜ Davutpaşa Kampüsü Matematik Bölümü EZ-18

Konuşmacı: Emre Kolotoğlu, Ph.D (Florida Atlantic University)

Başlık: Construction of Graph Designs with Prescribed Automorphism Groups


Özet:  A (simple, undirected) graph G is an ordered pair (V;E), where V is
a set of elements called vertices (or points), and E is a set of 2-element
subsets of V , called edges. A graph consisting of all possible edges on n
vertices is called a complete graph, denoted by Kn. For a graph G, a
decomposition of Kn into disjoint copies of G is called a G-design of order
n. The

spectrum for a graph G is the set of positive integers n such that there
exists a G-design of

order n.

In the literature, the problem of determining the spectrum of a graph has
been considered

for several types of graphs, such as complete graphs, trees, cycles,
matchings, paths, stars,

cubes, graphs of geometric solids, even graphs, theta graphs, unions of
graphs, all graphs

with up to ve vertices, and all graphs with six vertices and up to nine
edges. The spectrum

problem has been completely solved for cycles, matchings, paths, stars,
graphs with up to

ve vertices, and graphs with six vertices and up to eight edges.

In this talk, I will introduce some direct construction techniques for
graph designs.
-------------- sonraki bölüm --------------
Bir HTML eklentisi temizlendi...
URL: <http://yunus.listweb.bilkent.edu.tr/cgi-bin/mailman/private/turkmath/attachments/20140221/75d81dc9/attachment-0001.html>