Skip to main content
SpringerLink
Log in

The connectivities of adjacent tree graphs

  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

Abstract

The connectivity and the circuit rank of a graphG are denoted byx(G) andρ, respectively. It is shown that ifH is the adjacent tree graph of a simple connected graphG, thenx(H)=2ρ.

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. M. Cai, A solution of Chartrand's problem on spanning trees,Acta Math. Appl. Sinica (English Ser.),1 (1984), 7–8.

    Google Scholar 

  2. R. L. Cummins, Hamilton circuits in tree graphs,IEEE Trans. Circuit Theory,13 (1966), 82–96.

    Google Scholar 

  3. G. Liu, The connectivities of matroid base graphs,J. Operations Research,3: 1 (1984), 67–68.

    Google Scholar 

  4. B. Bollobas, Extremal Graph Theory, Academic Press, London, New York, San Francisco, 1978, p. 10.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shandong University, China

    Liu Guizhen

Authors
  1. Liu Guizhen
    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

Liu, G. The connectivities of adjacent tree graphs. Acta Mathematicae Applicatae Sinica 3, 313–317 (1987). https://doi.org/10.1007/BF02008369

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation