Cart (Loading....) | Create Account
Close category search window
 

Optimum Featurs and Graph Isomorphism

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shah, Yogesh J. ; Department of Electrical Engineering, University of Wisconsin-Milwaukee, Milwaukee, Wis. 53201. ; Davida, George I. ; McCarthy, Michael K.

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].

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-4 ,  Issue: 3 )

Date of Publication:

May 1974

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.