Skip to main content
SpringerLink
Log in

Graphs with two isomorphism classes of spanning unicyclic subgraphs

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

The graphs whose spanning unicyclic subgraphs partition into exactly two isomorphism classes are characterized.

This work is a continuation of [6] where graphs with one isomorphism class of spanning unicyclic graphs are characterized. The analogous question for spanning trees was posed in [10] and graphs with one isomorphism class of spanning trees were characterized in [2], [3], [4], [7], [11] while graphs with two isomorphism classes of spanning trees were characterized in [4], [5]. Related topics are treated in [1], [8], [9].

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. Duchet, P., Tuza, Z., Vestergaard, P.D.: Graphs In Which All Spanning Withr Edges Less Are Isomorphic. Congr. Numerantium67, 45–58 (1988)

    Google Scholar 

  2. Fischer, R.: Über Graphen mit isomorphen Gerüsten. Monatsh. Math.77, 24–30 (1973)

    Google Scholar 

  3. Friess, L.: Graphen, worin je zwei Gerüste isomorph sind. Math. Ann.204, 65–71 (1973)

    Google Scholar 

  4. Hartnell, B.L.: On Graphs With Exactly Two Isomorphism Classes of Spanning Trees. Util. Math.6, 121–137 (1974)

    Google Scholar 

  5. Hartnell, B.L.: The Characterization of Those Graphs whose Spanning Trees can be partitioned into Two Isomorphism Classes. Ph.D. Thesis, Faculty of Mathematics, University of Waterloo, 1974

  6. Vestergaard, P.D.: Graphs With One Isomorphism Class of Spanning Unicyclic Graphs. Discrete Math.70, 103–108 (1988)

    Google Scholar 

  7. Vestergaard, P.D.: Finite And Infinite Graphs Whose Spanning Trees Are Pairwise Isomorphic. Ann. Discrete Math.41, 421–436 (1989)

    Google Scholar 

  8. Vestergaard, P.D.: On Graphs With Prescribed Spanning Subgraphs. Ars Comb.24A, 47–58 (1987)

    Google Scholar 

  9. Vestergaard, P.D.: Graphs Whose One Edge Deletions Partition into Two Isomorphism Classes. Colloq. Math. Soc. Janos Bolayi52, 527–540 (1988)

    Google Scholar 

  10. Wagner, K.: Graphentheorie. Mannheim: Bibliographisches Institut 1970

    Google Scholar 

  11. Zelinka, B.: Grafu, jejichž všechny kostry jsou spolu isomorfni. Časopis pro pěstováni matematiky,96, 33–40 (1971) Graphs, All of whose Spanning Trees are Isomorphic to Each Other.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Institute of Electronic Systems, Aalborg University, Denmark

    Preben Dahl Vestergaard

Authors
  1. Preben Dahl Vestergaard
    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

Vestergaard, P.D. Graphs with two isomorphism classes of spanning unicyclic subgraphs. Graphs and Combinatorics 7, 197–204 (1991). https://doi.org/10.1007/BF01788144

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation