2019/10/24 by Ibrahim, Hany
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1910.11196
In 1994, Cornelis Hoede and Xueliang Li introduced the clique polynomial of a graph. Also, a theorem for the edge subgraph expansion for clique polynomials. In this note we present a counter example for it and explain which case it could be a valid theorem.