Clique Complex Homology: A Combinatorial Invariant for Chordal Graphs
Author(s): Allen D. Parks
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.
algebraic graph theory, chordal graph, clique complex, hypergraph, homology, Mayer-Vietoris theorem, graph invariant, Euler-PoincarÃ© formula
Cite this Article:
International Journal of Sciences is Open Access Journal.
This article is licensed under a Creative Commons Attribution 4.0 International (CC BY 4.0) License.
Author(s) retain the copyrights of this article, though, publication rights are with Alkhaer Publications.
Share this Issue with Friends: