# Self complementary graph examples 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.

• How many vertices can a selfcomplementary graph have MathOverflow
• SelfComplementary Graph from Wolfram MathWorld
• Constructing selfcomplementary graphs Mathematics Stack Exchange
• Self Complementary Graphs Mathonline

• 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 Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

How many vertices can a self-complementary graph have?

## Constructing selfcomplementary graphs Mathematics Stack Exchange

I thought you wanted all of them! Color the edges in each cycle alternately black and white.

Video: Self complementary graph examples Complement Graph

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Note that for a graph to isomorphic to another in general, then the number of vertices in both graphs must be the same. Of course, this is no problem for. 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?

### 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.

### 4 thoughts on “Self complementary graph examples”

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

2. 3. 4. 