By Topic

A New Algorithm for Graph Monomorphism Based on the Projections of the Product Graph

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
$33 $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)
Folorunso A. Akinniyi ; Systems Design Engineering Department, University of Waterloo, Waterloo, ON, Canada now with the Federal Agricultural Coordinating Unit, Ibadan, Nigeria, on leave from the University of Lagos, Lagos, Nigeria ; Andrew K. C. Wong ; Deborah A. Stacey

A new algorithm is presented for detecting graph monomorphisms for a pair of graphs. This algorithm entails a tree search based on the projections of the product graph called the net of the two graphs. It uses the minimum number of neighbors of the projected graphs to detect infeasible subtrees. The algorithm, in comparison with that of Deo and coworkers, is more efficient in its storage space utilization and average execution time. It does not suffer from the ambiguity which arises in Deo et al.'s work when cyclic graphs are matched. Applications to attributed graph monomorphisms are included.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:16 ,  Issue: 5 )