Topological code of graphs

DOI10.1016/0016-0032(92)90100-UzbMath0767.05042MaRDI QIDQ1188076

Kin-Tak Lam, Cheng-Ho Hsu

Publication date: 3 August 1992

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

zbMATH Keywords

adjacency matrixisomorphic graphstopological code

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Enumeration of basic kinematic chains with simple and multiple joints

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Numerical representation and identification of graphs
• Optimum Featurs and Graph Isomorphism
• An Efficient Algorithm for Graph Isomorphism
• GIT—a heuristic program for testing pairs of directed line graphs for isomorphism

This page was built for publication: Topological code of graphs