on a self-complementary graph problem

From	Daniel Bastos <dbastos@toledo.com>
Newsgroups	alt.algebra.help, comp.programming
Subject	on a self-complementary graph problem
Date	2017-09-09 15:48 -0300
Organization	Aioe.org NNTP Server
Message-ID	<86h8wbemis.fsf@toledo.com> (permalink)

Cross-posted to 2 groups.

Show all headers | View raw

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.

Back to comp.programming | Previous | Next — Next in thread | Find similar | Unroll thread

Thread

on a self-complementary graph problem Daniel Bastos <dbastos@toledo.com> - 2017-09-09 15:48 -0300
  Re: on a self-complementary graph problem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-09-09 21:05 +0100
    Re: on a self-complementary graph problem Daniel Bastos <dbastos@toledo.com> - 2017-09-16 11:13 -0300
      Re: on a self-complementary graph problem Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-09-16 16:10 +0100
        Re: on a self-complementary graph problem Daniel Bastos <dbastos@toledo.com> - 2017-09-17 07:32 -0300

csiph-web