Skip to main content
SpringerLink
Log in

A new result about panconnectivity on graphs

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

Abstract

LetG be a simple graph such that the sum of the degrees of any two independent vertices ofG is at leastn−1. We shall prove thatG is [6,n]-panconnected except for four kinds of graphs.

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. R. J. Faudree and R. H. Schelp, Path connected graphs,Acta Math. Sci. Hungar.,25 (1974), 313–319.

    Google Scholar 

  2. Cai Xiaotao, On the Panconnectivity of Ore Graph,Scientia Sinica, Series A,27 (1984), 684–694.

    Google Scholar 

  3. H. Enomoto, Long Paths and Large Cycles in Finite Graphs,J. Graph Theory,8 (1984), 287–301.

    Google Scholar 

  4. Bill Jackson, Hamilton Cycles in Regular 2-Connected Graphs,J. Comb. Theory,29 (B) (1980), 27–46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Huazhong Normal University, China

    Wei Bing

  2. Institute of Systems Science, Academia Sinica, China

    Zhu Yongjin

Authors
  1. Wei Bing
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhu Yongjin
    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

Wei, B., Zhu, Y. A new result about panconnectivity on graphs. Acta Mathematicae Applicatae Sinica 7, 143–149 (1991). https://doi.org/10.1007/BF02006100

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation