Skip to main content
SpringerLink
Log in

Connected graphs containing a given connected graph as a unique greatest common subgraph

  • Research Papers
  • Published:
aequationes mathematicae Aims and scope Submit manuscript

Abstract

Those connected graphsG are determined for which there exist nonisomorphic connected graphs of equal size containingG as a unique greatest common subgraph. Analogous results are also obtained for weakly connected and strongly connected digraphs, as well as for induced subgraphs and induced subdigraphs.

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. Behzad, M., Chartrand, G. andLesniak-Foster, L.,Graphs and digraphs. Wadsworth International, Belmont, CA 1979.

    Google Scholar 

  2. Chartrand, G., Saba, F. andZou, H.,Edge rotations and distances between graphs. Časopis Pěst. Math.110 (1985), 87–91.

    Google Scholar 

  3. Chartrand, G., Saba, F. andZou, H.,Greatest common subgraphs of graphs. (submitted for publication).

Download references

Author information

Authors and Affiliations

  1. Computational Chemistry Support, The Upjohn Company, 49001, Kalamazoo, MI, USA

    Gary Chartrand, Mark Johnson & Ortrud R. Oellermann

  2. Department of Mathematics, Western Michigan University, 40098, Kalamazoo, MI, USA

    Gary Chartrand, Mark Johnson & Ortrud R. Oellermann

Authors
  1. Gary Chartrand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ortrud R. Oellermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by a Western Michigan University faculty research fellowship.

This research was supported in part by a Western Michigan University research assistantship from the Graduate College and the College of Arts and Sciences.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chartrand, G., Johnson, M. & Oellermann, O.R. Connected graphs containing a given connected graph as a unique greatest common subgraph. Aeq. Math. 31, 213–222 (1986). https://doi.org/10.1007/BF02188190

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS (1980) subject classification

Search

Navigation