Skip to main content
SpringerLink
Log in

0-Dual Closures for Several Classes of Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

We prove that for almost all sufficient conditions based on degree sums or neighborhood unions of 3-independent sets for a graph G to be hamiltonian imply that the 0-dual closure of G is complete. The proofs are very short.

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

Author information

Authors and Affiliations

  1. Campus de Schoelcher, UAG-CEREGMIA-GRIMAAG, B.P. 7209, 97275, Schoelcher Cedex, Martinique, France

    Ahmed Ainouche

  2. Department of Mathematics, Technical University of Freiberg, D-09596, Freiberg, Germany

    Ingo Schiermeyer

Authors
  1. Ahmed Ainouche
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ingo Schiermeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ahmed Ainouche.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ainouche, A., Schiermeyer, I. 0-Dual Closures for Several Classes of Graphs. Graphs and Combinatorics 19, 297–307 (2003). https://doi.org/10.1007/s00373-002-0523-y

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-002-0523-y

Keywords

Search

Navigation