Skip to main content
Conference Proceedings

Largest graphs of diameter 2 and maximum degree 6

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4123 LNCS 853-857
DOI: 10.1007/11889342_54
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The results of computer generation of the largest graphs of diameter 2 and maximum degree 6 are presented. The order of such graphs is equal 32. There are exactly 6 graphs of diameter 2 and maximum degree 6 on 32 vertices including one vertex-transitive graph. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Molodtsov, S. G. (2006). Largest graphs of diameter 2 and maximum degree 6. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4123 LNCS, pp. 853–857). https://doi.org/10.1007/11889342_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free