DocumentCode
1412063
Title
Optimum Featurs and Graph Isomorphism
Author
Shah, Yogesh J. ; Davida, George I. ; McCarthy, Michael K.
Author_Institution
Department of Electrical Engineering, University of Wisconsin-Milwaukee, Milwaukee, Wis. 53201.
Issue
3
fYear
1974
fDate
5/1/1974 12:00:00 AM
Firstpage
313
Lastpage
319
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
Chemical compounds; Chemistry; Clustering algorithms; Computer networks; Feature extraction; Graph theory; Information retrieval; Organic compounds; Symmetric matrices; Testing;
fLanguage
English
Journal_Title
Systems, Man and Cybernetics, IEEE Transactions on
Publisher
ieee
ISSN
0018-9472
Type
jour
DOI
10.1109/TSMC.1974.5409142
Filename
5409142
Link To Document