Title of article
Homogeneously almost self-complementary graphs
Author/Authors
?ajna، نويسنده , , Mateja and Poto?nik، نويسنده , , Primo?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
4
From page
291
To page
294
Abstract
We give necessary and sufficient conditions on n for there to exist a homogeneously almost self-complementary graph of order 2n for the cases when n is an odd prime power, and when n is twice a prime. We introduce a unified approach to almost self-complementary graphs via brick assignments, and use it to construct several important families of homogeneously almost self-complementary graphs.
Keywords
almost self-complementary graph , homogeneously almost self-complementary graph , brick assignment , self-complementary graph , complete graph minus a 1-factor , homogeneous factorization , vertex-transitive graph
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454152
Link To Document