| dc.creator |
Biyikoglu, Turker |
|
| dc.creator |
CİVAN, Yusuf |
|
| dc.date |
2012-02-29T22:00:00Z |
|
| dc.date.accessioned |
2020-10-06T11:22:37Z |
|
| dc.date.available |
2020-10-06T11:22:37Z |
|
| dc.identifier |
c30fdaa6-e949-4d05-a38f-0d9acc31e08a |
|
| dc.identifier |
10.1007/s00026-011-0120-7 |
|
| dc.identifier |
https://avesis.sdu.edu.tr/publication/details/c30fdaa6-e949-4d05-a38f-0d9acc31e08a/oai |
|
| dc.identifier.uri |
http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/71343 |
|
| dc.description |
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. |
|
| dc.language |
eng |
|
| dc.rights |
info:eu-repo/semantics/closedAccess |
|
| dc.title |
Four-Cycled Graphs with Topological Applications |
|
| dc.type |
info:eu-repo/semantics/article |
|