Clique vectors of k-connected chordal graphs
2015 (English)In: Journal of combinatorial theory. Series A (Print), ISSN 0097-3165, E-ISSN 1096-0899, Vol. 132, 188-193 p.Article in journal (Refereed) Published
The clique vector c(G) of a graph G is the sequence (c(1), c(2), ..., c(d)) in N-d, where c(i) is the number of cliques in G with i vertices and d is the largest cardinality of a clique in G. In this note, we use tools from commutative algebra to characterize all possible clique vectors of k-connected chordal graphs.
Place, publisher, year, edition, pages
2015. Vol. 132, 188-193 p.
Clique vectors, Chordal graphs, Graph connectivity
IdentifiersURN: urn:nbn:se:kth:diva-145028DOI: 10.1016/j.jcta.2015.01.001ISI: 000350528900009ScopusID: 2-s2.0-84921502318OAI: oai:DiVA.org:kth-145028DiVA: diva2:715776
QC 20150408. Updated from submitted to published.2014-05-062014-05-062016-05-16Bibliographically approved