 | 1 | initial version |
I would like to define a graph G as follows:
Assume T is a graph with t leaves. Add t copies of Petersen graph to T and identify a vertex from the outer cycle of each Petersen graph with a leaf such that t added Petersen graphs are disjoint.
I would appreciate it if you tell how I can define this graph.
I would like to define a graph G as follows:
Assume T is a graph with t leaves. Add t copies of Petersen graph to T and identify a vertex from the outer cycle of each Petersen graph with a leaf such that t added Petersen graphs are disjoint.
I would appreciate it if you tell how I can define this graph.
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.
