Skip to main content
Log in

A note on Z 3-connected graphs with degree sum condition

  • Published:
Acta Mathematica Sinica, English Series Aims and scope Submit manuscript

Abstract

A graph G satisfies the Ore-condition if d(x)+d(y) ≥ |V(G)| for any xyE(G). Luo et al. [European J. Combin., 2008 characterized the simple Z 3-connected graphs satisfying the Ore-condition. In this paper, we characterize the simple Z 3-connected graphs G satisfying d(x) + d(y) ≥ |V(G)| − 1 for any xyE(G), which improves the results of Luo et al.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Jaeger, F., Linial, N., Payan, C., et al.: Group connectivity of graphs — A nonhomogeneous analogue of nowhere zero flow properties. J. Combin. Theory, Ser. B, 56, 165–182 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bondy, J. A., Murty, U. S. R.: Graph Theory with Applications, North-Holland, New York, 1976

    MATH  Google Scholar 

  3. Kochol, M.: An equivalent version of the 3-flow conjecture. J. Combin. Theory Ser. B, 83, 258–261 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fan, G., Zhou, C.: Ore condition and nowhere-zero 3-flows. SIAM J. Discrete Math., 22, 288–194 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Luo, R., Xu, R., Yin, J., et al.: Ore-condition and Z 3-connectivity. European J. Combin., 29, 1587–1595 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fan, G., Zhou, C.: Degree sum and nowhere-zero 3-flows. Discrete Math., 308, 6233–6240 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Zhang, X., Zhan, M., Xu, R., et al.: Degree sum condition for Z 3-connectivity in graphs. Discrete Math., 310, 3390–3397 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lai, H., Li, X., Shao, Y., et al.: Group connectivity and group colorings of graphs — A survey. Acta Mathematica Sinica, English Series, 27, 405–434 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chen, J. J., Eschen, E., Lai, H.: Group connectivity of certain graphs. Ars Combin., 89, 141–158 (2008)

    MathSciNet  MATH  Google Scholar 

  10. DeVos, M., Xu, R., Yu, G.: Nowhere-zero Z 3-flows through Z 3-connectivity. Discrete Math., 306, 26–30 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fan, G., Lai, H., Xu, R., et al.: Nowhere-zero 3-flows in triangularly connected graphs. J. Combin. Theory, Ser. B, 98, 1325–1336 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lai, H.: Group connectivity of 3-edge-connected chordal graphs. Graphs Combin., 16, 165–176 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xin Min Hou.

Additional information

Supported by National Natural Science Foundation of China (Grant No. 11071233) and the Fundamental Research Funds for the Central Universities (Grant No. WK0010000021)

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hou, X.M. A note on Z 3-connected graphs with degree sum condition. Acta. Math. Sin.-English Ser. 28, 2161–2168 (2012). https://doi.org/10.1007/s10114-012-0710-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10114-012-0710-2

Keywords

MR(2000) Subject Classification

Navigation