10 vertex Difficult Graph

ImageThe graph6 string for this graph is ‘ICOfeY{^_’. The independence number for this graph is 3. Lovasz theta = 3.197, Cvetkovic = 5, residue = 2, even_minus_even_horizontal = 2. So the upper bound predicts the independence number. We either need to characterize equality for Lovasz theta (or find some other alpha-property for this graph) or we need to find a lower bound that yields the independence number for this graph.

This is the last difficult graph I will obtain using my fork of the program. From now on I plan to switch over to Patrick’s fork (the one on Github).


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s