Papers
Topics
Authors
Recent
Search
2000 character limit reached

The distinguishing numbers of merged Johnson graphs

Published 6 Jun 2011 in math.CO | (1106.1007v1)

Abstract: In present article, we determine the distinguishing number of the merged Johnson graphs which are generalization of both the Kneser graphs and of the Johnson graphs.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up