Counting graph isomorphisms among chordal graphs with restricted clique number

摘要

In this paper, we show that given two chordal graphs G, H with restricted clique number, counting graph isomorphisms among G, H is computable in O(k!n{sup}3) time.