Prefer a chat interface with context about you and your work?
The Neighborhood Polynomial of Chordal Graphs
We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its vertices that have a common neighbor. We introduce a parameter for chordal graphs called anchor width and an algorithm to compute the …