Computable Categoricity of Graphs with Finite Components

A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably categorical graphs. We restrict ourselves to strongly locally finite graphs; these are the graphs all of whose components are finite. We present a necessary and sufficient condition for certain classes of strongly locally finite graphs to be computably categorical. We prove that if there exists an infinite 0 2-set of components that can be properly embedded into infinitely many components of the graph then the graph is not computably categorical. We also show that the 0 2-bound found is sharp. This is proved by a construction (that we outline in this paper) that builds a strongly locally finite computably categorical graph with an infinite chain of properly embedded components. There are also several examples.

• Type: Conference
• Year: 2008
• Where: CIE
• Authors: Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu
• Keywords: Applied Computing, Categorical Graph, CIE 2008, Computable Graph, Finite Graphs