Graph Isomorphisms

A graph is a mathematical object consisting of a vertex set related by an edge set. For two graphs to be considered isomorphic there must be a one to one mapping of their vertex sets onto the other that preserves adjacency. The graph isomorphism problem has a long history of study of heuristic methods and algorithmic solutions. Particularly concerning much larger graphs, it has been useful to examine how traits of different types of subgraphs allow for easier comparisons. In this manner, algorithms for determining whether certain types of graphs are isomorphic have been developed. However not all cases are so simple, so the problem's complexity class remains uncertain. The many advancements made in the study of graph isomorphisms have created a deeper understanding of different areas of study in both mathematics and computer science. This paper will review some of the existing methods and the history of research into the problem.

Accessibility Statement

Purchase College - State University of New York (PC) is committed to ensuring that people with disabilities have an opportunity equal to that of their nondisabled peers to participate in the College's programs, benefits, and services, including those delivered through electronic and information technology. If you encounter an access barrier with a specific item and have a remediation request, please contact lib.ir@purchase.edu.

Graph Isomorphisms

Journal Title

Keywords

Readers/Advisors

Journal Title

Term and Year

Publication Date

Book Title

Publication Volume

Publication Issue

Publication Begin

Publication End

Number of pages

Collections

Files

Research Projects

Organizational Units

Journal Issue

URI

Abstract

Citation

DOI

Description

Accessibility Statement

Embedded videos