Skip to main content
SpringerLink
Log in

H-extension of graphs

  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C. Berge,Graphs and Hypergraphs, North-Holland Publishing Company, 1973.

  2. H. H. Teh andS. C. Shee,Algebraic Theory of Graphs, Lee Kong Chian Institute of Mathematics and Computer Science, Nanyang University, Singapore 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, National University of Singapore, Singapore

    S. C. Shee & H. H. Teh

Authors
  1. S. C. Shee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. H. Teh
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shee, S.C., Teh, H.H. H-extension of graphs. Combinatorica 4, 207–211 (1984). https://doi.org/10.1007/BF02579222

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579222

AMS subject classification (1980)

Search

Navigation