PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
subdivision (Definition)

A graph $H$ is said to be a subdivision, or topological minor of a graph $G$ , or a topological $G$ graph if $H$ is obtained from $G$ by subdividing some of the edges, that is, by replacing the edges by paths having at most their endvertices in common. We often use $TG$ for a topological $G$ graph.

Thus, $TG$ denotes any member of a large family of graphs; for example, $TC_4$ is an arbitrary cycle of length at least 4. For any graph $G$ , the spaces $R(G)$ (denoting the realization of G) and $R(TG)$ are homeomorphic.

Adapted with permission of the author from Modern Graph Theory by Béla Bollobás, published by Springer-Verlag New York, Inc., 1998.




"subdivision" is owned by CWoo. [ full author list (2) | owner history (2) ]
(view preamble | get metadata)

View style:

See Also: homeomorphism, realization of a graph

Other names:  topological minor
Log in to rate this entry.
(view current ratings)

Cross-references: homeomorphic, length, cycle, endvertices, paths, edges, graph
There are 9 references to this entry.

This is version 2 of subdivision, born on 2002-03-07, modified 2008-05-06.
Object id is 2772, canonical name is Subdivision.
Accessed 5318 times total.

Classification:
AMS MSC05C99 (Combinatorics :: Graph theory :: Miscellaneous)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)