Please use this identifier to cite or link to this item:
Title: H-extension of graphs
Authors: Shee, S.C. 
Teh, H.H. 
Keywords: AMS subject classification (1980): 05C10, 05C25
Issue Date: Jun-1984
Citation: Shee, S.C., Teh, H.H. (1984-06). H-extension of graphs. Combinatorica 4 (2-3) : 207-211. ScholarBank@NUS Repository.
Abstract: We consider the problem of constructing a graph G* from a collection of isomorphic copies of a graph G in such a way that for every two copies of G, either no vertices or a section graph isomorphic to a graph H is identified. It is shown that if G can be partitioned into vertex-disjoint copies of H, then G* can be made to have at most |H| orbits. A condition on G so that G* can be vertextransitive is also included. © 1984 Akadémiai Kiadó.
Source Title: Combinatorica
ISSN: 02099683
DOI: 10.1007/BF02579222
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.