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.
Like that
sage: G = graphs.PetersenGraph()
sage: G.num_edges()
15
sage: G.subdivide_edges(G.edges(),1)
sage: G.num_edges()
30suppose G is the peterson graph on 15 vertices. How to find adjancy matrix of its subdivision graph.
thanks for answer
Asked: 3 years ago
Seen: 409 times
Last updated: Nov 29 '21
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
