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...
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Discrete Mathematics & Theoretical Computer Science
2022-05-01
|
| Seri Bilgileri: | Discrete Mathematics & Theoretical Computer Science |
| Konular: | |
| Online Erişim: | https://dmtcs.episciences.org/8388/pdf |