Check for Isomorphism in Hypergraphs

  • Context: Graduate 
  • Thread starter Thread starter Jerrynap
  • Start date Start date
  • Tags Tags
    Algorithm Isomorphism
Click For Summary
SUMMARY

This discussion focuses on checking for isomorphism in hypergraphs using MATLAB. The initial brute force method of permuting vertices is inefficient. A suggestion was made to represent hypergraphs as bipartite graphs to check for isomorphism, although there is uncertainty about whether non-isomorphic hypergraphs can yield isomorphic bipartite graphs. Additionally, the application of Whitney's theorem for hypergraph isomorphism was mentioned, highlighting a need for a more efficient algorithm for this purpose.

PREREQUISITES
  • Understanding of hypergraphs and their properties
  • Familiarity with bipartite graphs and their isomorphism
  • Knowledge of MATLAB programming for algorithm implementation
  • Basic comprehension of Whitney's theorem in graph theory
NEXT STEPS
  • Research algorithms for hypergraph isomorphism, such as the McKay's Nauty algorithm
  • Explore the application of Whitney's theorem in hypergraph theory
  • Learn about graph representation techniques in MATLAB
  • Investigate the relationship between hypergraphs and bipartite graphs
USEFUL FOR

Researchers, mathematicians, and computer scientists working on graph theory, particularly those interested in hypergraph isomorphism and algorithm optimization.

Jerrynap
Messages
8
Reaction score
0
Hi,

I was trying to check whether two hypergraphs are isomorphic to each other using MATLAB. I did the brute force method by permuting the vertices and check all the permutations one by one. This method is pretty slow.

An idea suggested by my friend was to represent the hypergraphs as bipartite graphs and check whether the two bipartite graphs are isomorphic instead. However, we are unsure whether two non-isomorphic hypergraphs might have isomorphic bipartite graphs. Can someone enlighten us about this?

Furthermore, we thought of applying Whitney theorem to check for isomorphism, but we are not familiar with the theorem for hypergraph.

Of course it will be best if there is a readily available algorithm to check for isomorphism in hypergraphs. :)
 
Mathematics news on Phys.org
Thanks for the post! Sorry you aren't generating responses at the moment. Do you have any further information, come to any new conclusions or is it possible to reword the post?
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
11K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K