Color the edges in each cycle alternately black and white. Furthermore, all self-complementary graphs have graph diameter 2 or 3 Sachs ; Skienap. Linked 9. Watch headings for an "edit" link when available. Weisstein, Eric W. By definition, a self-complementary graph must have exactly half the total possible number of edges, i. Aaron Hill Aaron Hill 5 5 bronze badges.

Examples. Every Paley graph is self-complementary.

## How many vertices can a selfcomplementary graph have MathOverflow

For example, the 3 × 3 rook's graph (the Paley graph of order nine) is self-complementary, by a symmetry that keeps the center. Every Paley graph is self-complementary. For example, the 3 × 3 rook's graph (the Paley graph of order nine) is self-complementary. Furthermore, all self-complementary graphs have graph diameter 2 or 3 (Sachs ; Skienap. ). For a self-complementary graph on n>5 vertices.

How many vertices can a self-complementary graph have? It works for 0 points, but not for 1 point.

## SelfComplementary Graph from Wolfram MathWorld

Debrecen 9, Terms of Use. Fold Unfold. Hints help you try the next step on your own. Sign up using Email and Password.

Here's a nice little algorithm for constructing a self-complementary graph from Example. To construct self-complementary graphs of order 5, take V={a,b,c,d,e}.

For example, when following question while considering the below examples. How many edges can a self-complementary graph on n vertices have?

Notify administrators if there is objectionable content in this page. Aaron Hill Aaron Hill 5 5 bronze badges. Post as a guest Name. Sign up using Facebook.

### Self Complementary Graphs Mathonline

Systematically is easy; systematically and efficiently, I don't know.

Spesifikasi yonex arcsaber d118 |
Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more. Read, R. Rao, S. Change the name also URL address, possibly the category of the page. Add a vertex by connecting it to the 2n vertices lying on fewer than 2n edges. |

John John 1 1 silver badge 5 5 bronze badges. Furthermore, all self-complementary graphs have graph diameter 2 or 3 Sachs ; Skienap.

Click here to edit contents of this page.

OEIS A Farrugia, A.

Question feed. Sloane, N.