Clique vectors of k-connected chordal graphs

From MaRDI portal
Publication:2258904



Abstract: The clique vector mathfrakc(G) of a graph G is the sequence (c1,c2,ldots,cd) in mathbbNd, where ci 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.












This page was built for publication: Clique vectors of \(k\)-connected chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2258904)