Abstract
Abstract We give necessary and sufficient conditions on n for there to exist a homogeneously almost self-complementary graph of order 2 n 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
