Deleting a matching from a graph

Processing math: 100%

First time here? Check out the FAQ!

vidyarthi
177 ●2 ●7 ●24

When I have a graph $G$ and a perfect matching given by G.matching() or by using the independent set in its line graph, I wish to know whether there is a method to delete the matching edges from the edge set of the graph. Like, I want to know a method that gives $G-M1$ for $M1$ being a matching in the graph. Is there any such method? Thanks beforehand..

Comments

@DavidCoudert thanks! it works

vidyarthi ( 2 years ago )

add a comment

1 Answer

Sort by » oldest newest most voted

answered 2 years ago

David Coudert
766 ●12 ●20 http://www-sop.inria.f...

G.matching() returns a list of edges, so you can do:

sage: G = graphs.PetersenGraph()
sage: G.order(), G.size()
(10, 15)
sage: M = G.matching()
sage: G.delete_edges(M)
sage: G.order(), G.size()
(10, 10)

link

add a comment

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

Stats

Asked: 2 years ago

Seen: 267 times

Last updated: May 02 '22

Deleting a matching from a graph savecancel

Comments

1 Answer

Your Answer

Question Tools

Stats

Related questions