Path: csiph.com!aioe.org!.POSTED!not-for-mail
From: Daniel Bastos <dbastos@toledo.com>
Newsgroups: alt.algebra.help,comp.programming
Subject: on a self-complementary graph problem
Date: Sat, 09 Sep 2017 15:48:27 -0300
Organization: Aioe.org NNTP Server
Lines: 12
Message-ID: <86h8wbemis.fsf@toledo.com>
NNTP-Posting-Host: fw9fX2ZGNOKrE4Av2ynPbQ.user.gioia.aioe.org
Mime-Version: 1.0
Content-Type: text/plain
X-Complaints-To: abuse@aioe.org
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (windows-nt)
X-Notice: Filtered by postfilter v. 0.8.2
Cancel-Lock: sha1:zAfyw+aON06ZUXw40w4zzLZlCLo=
Xref: csiph.com alt.algebra.help:4989 comp.programming:8003

I'm looking for a strategy on how to solve this problem.  I appreciate
any direction you may give me.

Problem.  A simple graph G is self-complementary if G =~ G^c.  Show if G
is self-complementary, then v = 0 (mod 4) or v = 1 (mod 4).

This is problem 1.2.11 item (b) in ``Graph theory with applications'' by
J.A. Bondy and U.S.R. Murty, Department of Combinatorics and
Optimization, University of Waterloo, Ontario, Canada.  North-Holland,
fifth printing, 1982.  ISBN: 0-444-19451-7.

Thank you.