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

1 | initial version |

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

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

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.

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.

5 | retagged |

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.

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.