Clique Vectors of k-Connected Chordal Graphs

2014/03/25 by Afshin Goodarzi, Goodarzi, Afshin · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.1403.6210

openalex publication_date 2014/03/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The clique vector \mathfrakc(G) of a graph G is the sequence (c₁, c₂, …,c_d) in ℕ^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.

Cited by

• Connectivity of pseudomanifold graphs from an algebraic point of view

Related

• Clique Polynomials and Chordal Graphs
• Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
• Optimal-size clique transversals in chordal graphs
• Vertex connectivity of chordal graphs
• Reduced clique graphs: a correction to "Chordal graphs and their clique graphs"