Optimum Featurs and Graph Isomorphism
- 1 May 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. SMC-4 (3), 313-319
- https://doi.org/10.1109/tsmc.1974.5409142
Abstract
An algorithm is presented to test the graph isomorphism for undirected linear graphs. The graph isomorphism between two or more graphs can be tested by obtaining their optimum codes. The algorithm relabels the nodes of graphs to obtain optimum codes. The optimum code is the code of maximum weight obtained from the upper triangle of the Adjacency matrix of the given graph. The method of ordering the nodes of a graph to produce a code invariant to isomorphism is related to invariant features in feature extraction [7], [15].Keywords
This publication has 7 references indexed in Scilit:
- On Arranging Elements of a Hierarchy in Graphic FormIEEE Transactions on Systems, Man, and Cybernetics, 1973
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Algorithms for finding a fundamental set of cycles for an undirected linear graphCommunications of the ACM, 1967
- Analysis of Graphs by Connectivity ConsiderationsJournal of the ACM, 1966
- A Mechanical Analysis of the Cyclic Structure of Undirected Linear GraphsJournal of the ACM, 1966
- A Graph-Theoretic Algorithm for Matching Chemical Structures.Journal of Chemical Documentation, 1965
- Strongly regular graphs, partial geometries and partially balanced designsPacific Journal of Mathematics, 1963