Characterisation of self-complementary chordal graphs

In this note we prove that a self-complementary graph with p vertices is chordal if and only if its clique number is integral part of ( p + 1)/2.

Saved in:
Bibliographic Details
Published in:Discrete mathematics 1998-06, Vol.188 (1), p.279-283
Main Authors: Sridharan, M.R., Balaji, K.
Format: Article
Language:English
Subjects:
Chordal graph
Self-complementary graph
Split graph and clique number
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this note we prove that a self-complementary graph with p vertices is chordal if and only if its clique number is integral part of ( p + 1)/2.
ISSN:0012-365X
1872-681X
DOI:10.1016/S0012-365X(98)00025-9