Abstract
We consider the problem of constructing a graphG* from a collection of isomorphic copies of a graphG in such a way that for every two copies ofG, either no vertices or a section graph isomorphic to a graphH is identified. It is shown that ifG can be partitioned into vertex-disjoint copies ofH, thenG* can be made to have at most |H| orbits. A condition onG so thatG* can be vertextransitive is also included.
Similar content being viewed by others
References
C. Berge,Graphs and Hypergraphs, North-Holland Publishing Company, 1973.
H. H. Teh andS. C. Shee,Algebraic Theory of Graphs, Lee Kong Chian Institute of Mathematics and Computer Science, Nanyang University, Singapore 1976.