Mathematics – Combinatorics
Scientific paper
2007-06-17
Mathematics
Combinatorics
Scientific paper
A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. In this paper we give some background to the study of transitive decompositions and highlight a connection with partial linear spaces. We then describe a simple method for constructing transitive decompositions using graph quotients, and we show how this may be used in an application to modular origami.
No associations
LandOfFree
Transitive decompositions of graphs and their links with geometry and origami does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Transitive decompositions of graphs and their links with geometry and origami, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transitive decompositions of graphs and their links with geometry and origami will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-332241