A chordal Graph is a connected graph which contains no chord-less cycle of size greater than three. They are also called as Triangulated graphs.
All Paths are Chordal Graphs (No cycles).
All Trees are chordal Graphs (No cycles).
All cliques are chordal graphs.
A Path contains the minimum no of edges and a clique contains the maximum number of edges of a given n vertices chordal graph
So for a fixed number 'n', what is the algorithm to find all the possible chordal graphs of n vertices?
- n= 2, Answer = 1 chordal graph.
- n= 3, Answer = 2 chordal graphs,
- n= 4, Answer = 5 chordal graphs,
- n= 5, Answer = 15 chordal graphs.
The above are determined by drawing all possible examples. Any algorithm?