Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Discovering near symmetry in graphs

Fox, M. and Long, D. and Porteous, J. (2007) Discovering near symmetry in graphs. In: Proceedings of AAAI 2007. Association for the Advancement of Artificial Intelligence. ISBN 978-1-57735-323-2

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

Symmetry is a widespread phenomenon that can offer opportunities for powerful exploitation in areas as diverse as molecular chemistry, pure mathematics, circuit design, biology and architecture. Graphs are an abstract way to represent relational structures. The search for symmetry in many contexts can thus be reduced to the attempt to find graph automorphisms. Brendan McKay's NAUTY system (McKay 1990) is an example of one of the highly successful products of research into this task. Erd˝os and R´enyi showed that almost all large graphs are asymmetric, but it is readily observed that many graphs representing structures of real interest contain symmetry. Even more graphs are nearly symmetric, in the sense that to each graph there is a closely similar graph that is symmetric. In this paper we explore the problem of finding near symmetries in graphs and describe the techniques we are developing for performing this task.

Item type: Book Section
ID code: 3420
Keywords: symmetry, graphs, relational structures, asymmetric, symmetric, artificial intelligence, Electronic computers. Computer science
Subjects: Science > Mathematics > Electronic computers. Computer science
Department: Faculty of Science > Computer and Information Sciences
Related URLs:
Depositing user: Professor Maria Fox
Date Deposited: 20 Jun 2007
Last modified: 17 Jul 2013 13:01
URI: http://strathprints.strath.ac.uk/id/eprint/3420

Actions (login required)

View Item