1989 Reports
Graph Imbeddings and Overlap Matrices (Preliminary Report)
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.
Subjects
Files
- cucs-484-89.pdf application/pdf 325 KB Download File
More About This Work
- Academic Units
- Computer Science
- Publisher
- Department of Computer Science, Columbia University
- Series
- Columbia University Computer Science Technical Reports, CUCS-484-89
- Published Here
- January 17, 2012