Homogeneously almost self-complementary graphs

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.