What is the Algorithm to find all the possible chordal graphs which can be formed by a given 'n' number of vertices
The best way to do it, if you want to generate billions of graphs is to read up on enumeration algorithms such as:

[Yasuko Matsui, Ryuhei Uehara and Takeaki Uno, Enumeration of Perfect Sequences of Chordal Graph (2008)]

However for many this may be more than what is needed.
An easier algorithm is:


Enumerate all chordal graphs on n-1 vertices.
For each chordal graph G on n-1 vertices and each clique C in G.
Create a graph G' by adding a vertex v with neighbours C.
If G' has not already been found, add G to the list of chordal graphs on n vertices.


By this algorithm you should be able to generate the chordal graphs on at most 11 vertices which means over a million graphs.