Skip to main content
SpringerLink
Log in

What is the difference between the domination and independent domination numbers of a cubic graph?

  • Research Problems
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We describe an infinite class of cubic graphs with connectivity two for which the difference between the domination and independent domination numbers becomes unbounded. We conjecture that for cubic graphs with connectivity three this difference is at most one.

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. Allan, R.B., Laskar, R.: On domination and independent domination numbers of a graph. Discrete Math.23, 73–76 (1978)

    Google Scholar 

  2. Berge, C.: Theory of Graphs and Its Applications. London: Methuen 1962

    Google Scholar 

  3. Cockayne, E.J., Hedetniemi, S.T.: Independence graphs. Congr. Numerantium10, 471–491 (1974)

    Google Scholar 

  4. Cockayne, E.J., Hedetniemi, S.T.: Towards a theory of domination in graphs. Networks7, 247–261 (1977)

    Google Scholar 

  5. Harary, F.: Graph Theory. Reading: Addison-Wesley 1969

    Google Scholar 

  6. Harary, F., Livingston, M.: The caterpillars with equal domination and independent domination numbers. Studies in Graph Theory, V.R. Kulli, ed., Vishwa, India: Gulbarga 149–154 (1989)

    Google Scholar 

  7. Harary, F., Livingston, M.: Characterization of trees with equal domination and independent domination numbers, Congr. Numerantium55, 121–150 (1986)

    Google Scholar 

  8. Harary, F., Richardson, M.: A matrix algorithm for solutions andr-bases of a finite irreflexive relation, Nav. Res. Logist. Q.6, 307–314 (1959)

    Google Scholar 

  9. Mitchell, S., Hedetniemi, S.: Independent domination in trees. Congr. Numerantium19, 489–510 (1977)

    Google Scholar 

  10. Mynhardt, C.: On the difference between the domination and independent domination numbers of cubic graphs. Theory of Graphs and Applications, New York: Wiley 1991 (to appear)

    Google Scholar 

  11. Ore, O.: Theory of Graphs. Amer. Math. Soc., Providence (1962)

    Google Scholar 

  12. von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton: Princeton University Press 1953

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. New Mexico Institute of Mining and Technology, 87801, Socorro, NM, USA

    Curtiss Barefoot

  2. New Mexico State University, 88003, Las Cruces, NM, USA

    Frank Harary

  3. University of Colorado at Denver, 80204, Denver, CO, USA

    Kathryn F. Jones

Authors
  1. Curtiss Barefoot
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Harary
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kathryn F. Jones
    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

Barefoot, C., Harary, F. & Jones, K.F. What is the difference between the domination and independent domination numbers of a cubic graph?. Graphs and Combinatorics 7, 205–208 (1991). https://doi.org/10.1007/BF01788145

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation