Clique Complex Homology: A Combinatorial Invariant for Chordal Graphs
| Main Author: | D. Parks, Allen |
|---|---|
| Format: | Article eJournal |
| Bahasa: | eng |
| Terbitan: |
, 2013
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/3348240 |
Daftar Isi:
- It is shown that a geometric realization of the clique complex of a connected chordal graph is homologically trivial and as a consequence of this it is always the case for any connected chordal graph G that ∑_(k=1)^ω(G)▒(-1)^(k-1) η_k (G)=1, where η_k (G) is the number of cliques of order k in G and ω(G) is the clique number of G.Read Complete Article at ijSciences: V2201306194