Ask Your Question

Determining Complete Bipartite Graphs

asked 2011-08-30 11:56:35 +0200

anonymous user


I have generated an extremely large list of graphs. Do you know if there is a way to determine which graphs in the list are Complete Bipartite graphs? I have tried a filter function: dd = filter(lambda x:x.completebipatitegraphs(), d), but it gives me an "attribute needed" error. Any help is greatly appreciated!

edit retag flag offensive close merge delete

2 Answers

Sort by ยป oldest newest most voted

answered 2011-08-31 13:14:31 +0200

Mike Hansen gravatar image

You can use the following function to test if a graph is complete bipartite:

def is_complete_bipartite(p):
    return p.is_bipartite() and p.num_edges() == mul(map(len, p.bipartite_sets()))

Then, you can do

dd = filter(is_complete_bipartite, d)

to get your list of complete bipartites.

edit flag offensive delete link more


Thanks for the help! I got what I wanted.

acacost1 gravatar imageacacost1 ( 2011-09-01 18:03:53 +0200 )edit

answered 2011-09-04 08:16:48 +0200

in case you want to practice writing lambdas, you can do

dd=filter(lambda p: p.is_bipartite() and p.num_edges() == mul(map(len, p.bipartite_sets())), d)
edit flag offensive delete link more


I have been reading the Sage References, and it does not seem that complete multipartite graphs are defined in Sage yet. I have tried to critique the code you have provide to try and see if it would work for complete multipartite graphs. I get a "graph attribute needed" error. I just wanted to verify that this is the case. Thanks again for the help!

acacost1 gravatar imageacacost1 ( 2011-09-07 01:08:51 +0200 )edit

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

1 follower


Asked: 2011-08-30 11:56:35 +0200

Seen: 590 times

Last updated: Sep 04 '11