Four-cycled graphs with topological applications
Yükleniyor...
Dosyalar
Tarih
2012-03
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Birkhauser Verlag AG
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
We call a simple graph G a 4-cycled graph if either it has no edges or every edge of it is contained in an induced 4-cycle of G. Our interest on 4-cycled graphs is motivated by the fact that their clique complexes play an important role in the simple-homotopy theory of simplicial complexes. We prove that the minimal simple models within the category of flag simplicial complexes are exactly the clique complexes of some 4-cycled graphs. We further provide structural properties of 4-cycled graphs and describe constructions yielding such graphs. We characterize 4-cycled cographs, and 4-cycled graphs arising from finite chessboards. We introduce a family of inductively constructed graphs, the external extensions, related to an arbitrary graph, and determine the homotopy type of the independence complexes of external extensions of some graphs.
Açıklama
Anahtar Kelimeler
Clique and independence complexes, Cycled graph, Cograph, Chessboard graph, Simple-homotopy, S-homotopy, Complexes, Homotopy
Kaynak
Annals of Combinatorics
WoS Q Değeri
Q4
Scopus Q Değeri
Q3
Cilt
16
Sayı
1
Künye
Bıyıkoğlu, T. & Civan, Y. (2012). Four-cycled graphs with topological applications. Annals of Combinatorics, 16(1), 37-56. doi:10.1007/s00026-011-0120-7
