Characterisation of self-complementary chordal graphs

Construction of Sc Chordal and Sc Weakly Chordal Graphs

“…In [10] the given algorithms construct the same graph many times. So in order to, compile a catalogue of sc chordal graphs with 4p+1 vertices, every pair of the constructed graphs should be tested whether the graphs are isomorphic or not after constructing all sc chordal graphs with 4p+1 vertices from the given algorithms.…”

“…Also from theorem-1 no other graph is possible with the same degree sequence. So it is eay to construct all the sc chordal graph by the algorithm-1 as compare to algorithm given in [10].…”

“…The overall procedure of the construction of sc chordal graph with the given degree sequence (10,10,8,8,6, 6, 5, 5, 3, 3, 1, 1) is obtained as given below and illustrated in figure-1 (i). The graph G 2 as shown in figure-1 respectively.…”

“…Figure 1. Construction of sc chordal graph with the given degree sequence (10,10,8,8,6,6,5,5,3,3,1,1) …”

“…Gibbs [11] has given algorithms for the construction of sc graphs with 4p and 4p+1 vertices. Sridharan and Balaji [10] also gave algorithms for the construction of sc chordal graphs with 4p and 4p+1 vertices by modifying the algorithm as discussed in [11].…”