how to find subdivision graph of any graph ?

graph-theory

asked 2021-11-29 08:47:00 +0100

Vinayak gupta
13 ●1

updated 2021-11-29 09:36:43 +0100

FrédéricC

5311 ●4 ●44 ●118

Strictly speaking, a subdivision of graph is graph obtained by placing a vertex between two adjacent vertices. path of length 2 is subdivision of path on length 1.

edit retag flag offensive close merge delete

add a comment

1 Answer

Sort by » oldest newest most voted

answered 2021-11-29 09:35:32 +0100

FrédéricC

5311 ●4 ●44 ●118

Like that

sage: G = graphs.PetersenGraph()
sage: G.num_edges()
15
sage: G.subdivide_edges(G.edges(),1)
sage: G.num_edges()
30

edit flag offensive delete link

Comments

suppose G is the peterson graph on 15 vertices. How to find adjancy matrix of its subdivision graph.

Vinayak gupta ( 2021-11-29 12:15:51 +0100 )edit

thanks for answer

Vinayak gupta ( 2021-11-29 12:16:19 +0100 )edit

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: 2021-11-29 08:47:00 +0100

Seen: 354 times

Last updated: Nov 29 '21

how to find subdivision graph of any graph ? edit