Academic Commons


Graph Imbeddings and Overlap Matrices (Preliminary Report)

Chen, Jianer; Gross, Jonathan L.

Mohar has shown an interesting relationship between graph imbeddings and certain boolean matrices. In this paper, we show some interesting properties of this kind of matrices. Using these properties, we give the distributions of nonorietable imbeddings of several interesting infinite families of graphs, including cobblestone paths, closed-end ladders for which the distributions of orientable imbeddings are known.



More About This Work

Academic Units
Computer Science
Department of Computer Science, Columbia University
Columbia University Computer Science Technical Reports, CUCS-484-89
Published Here
January 17, 2012