| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4655177 | Journal of Combinatorial Theory, Series A | 2015 | 6 Pages |
Abstract
The clique vector c(G) of a graph G is the sequence (c1,c2,â¦,cd) in Nd, 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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Afshin Goodarzi,