Zhejiang Daxue xuebao. Lixue ban (Mar 2010)

自余弱弦图(On self-complementary weakly chordal graphs)

  • MERAJUDDIN(),
  • PARVEZAli(),
  • KIRMANIS A K(),
  • PIRZADAS()

DOI
https://doi.org/10.3785/j.issn.1008-9497.2010.02.003
Journal volume & issue
Vol. 37, no. 2
pp. 131 – 136

Abstract

Read online

The class of self-complementary (sc) weakly chordal graphs is studied, which is a generalization of self-complementary chordal graphs, lower and upper bounds for the number of two-pairs in sc weakly chordal graphs have been obtained. The recognition problem on the self-complementary weakly chordal graphs is discussed. In particular, an O(m3) time algorithm which determines whether a self-complementary graph is weakly chordal or not is discussed. Moreover, self-complementary weakly chordal graphs with at most 17 vertices is in catalogue.

Keywords