A new counting methods, including the issue of counting labelled self-complementary graphs

Details A new counting methods, including the issue of counting labelled self-complementary graphs A new counting methods, including the issue of counting labelled self-complementary graphs

2009-09-12

arxiv.org/abs/0909.2314v1

Mathematics

Combinatorics

13 pages

Scientific paper

Harary and Palmer announced an enumeration problem of labelled self-complementary graphs at the end of their book (Graphical Enumeration, Academic Press, New York and London, 1973). This paper resolves this problem. A method for solving this problem leads to the derivation of following formulas: (a) A formula on the number of labelled graphs with the given order of automorphism groups of those graphs. (b) A formula on the number of unlabelled graphs with the given order of automorphism groups of those graphs. (c) A formula on the number of labelled self-complementary graphs with the given order of automorphism groups of those graphs. (d) A formula on the number of unlabelled self-complementary graphs with the given order of automorphism groups of those graphs.

Affiliated with

Also associated with

No associations

Rating

A new counting methods, including the issue of counting labelled self-complementary graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new counting methods, including the issue of counting labelled self-complementary graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new counting methods, including the issue of counting labelled self-complementary graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-477328