Skip to main content
Book ChapterOPEN ACCESS

Computing Symmetries of Combinatorial Objects

  • McKay B
Springer Berlin Heidelberg, (2008), 1-1
DOI: 10.1007/978-3-540-77537-9_1
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We survey the practical aspects of computing the symmetries (automorphisms) of combinatorial objects. These include all manner of graphs with adornments, matrices, point sets, etc.. Since automorphisms are just isomorphisms from an object to itself, the problem is intimately related to that of finding isomorphisms between two objects.

Cite

CITATION STYLE

APA

McKay, B. D. (2008). Computing Symmetries of Combinatorial Objects. In Graph Drawing (pp. 1–1). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-77537-9_1

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