[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Edge Criticality in Graph Domination

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A vertex subset \(D\subseteq V\) of a graph \(G=(V,E)\) is a dominating set of G if each vertex of G is a member of D or is adjacent to a member of D. The cardinality of a smallest dominating set of G is called the domination number of G and a nonempty graph G is q-critical if q is the smallest number of arbitrary edges of G whose removal from G necessarily increases the domination number of the resulting graph. The classes of q-critical graphs of order n are characterised in this paper for all admissible combinations of values of n and q.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Bauer, D., Harary, F., Nieminen, J., Sujel, C.L.: Domination alteration sets in graphs. Discret. Math. 47, 153–161 (1983)

    Article  MATH  Google Scholar 

  2. Berge, C.: Theory of Graphs and its Applications. Methuen, London (1962)

    MATH  Google Scholar 

  3. Fink, J.F., Jacobson, M.S., Kinch, L.F., Roberts, J.: The bondage number of a graph. Discret. Math. 86, 47–57 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hartnell, B.L., Jorgensen, L.K., Vestergaard, P.D., Whitehead, C.A.: Edge-stability of the \(k\)-domination number of trees. Bull. Inst. Comb. Appl. 22, 31–40 (1998)

    MathSciNet  MATH  Google Scholar 

  5. Hartnell, B.L., Rall, D.F.: A characterisation of trees in which no edge is essential to the domination number. Ars Comb. 33, 65–76 (1992)

    MathSciNet  MATH  Google Scholar 

  6. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1997)

    Google Scholar 

  7. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1997)

    Google Scholar 

  8. Hu, F.-T., Xu, J.-M.: On complexity of bondage and reinforcement. J. Complex. 28(2), 192–201 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ore, O.: Theory of graphs. Am. Math. Soc. Trans. 38, 206–212 (1962)

    Google Scholar 

  10. Teschner, U.: New results about the bondage number of a graph. Discret. Math. 171, 249–259 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Walikar, H.B., Acharya, B.D.: Domination critical graphs. Natl. Acad. Sci. Lett. 2, 70–72 (1979)

    MATH  Google Scholar 

Download references

Acknowledgments

The author is indebted to Dr Anton de Villiers for producing the graphics in this paper. The anonymous reviewers are also thanked for their suggestions which have improved the quality of the paper.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Stellenbosch University, Private Bag X1, Matieland, 7602, South Africa

    Jan H van Vuuren

Authors
  1. Jan H van Vuuren
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jan H van Vuuren.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

van Vuuren, J.H. Edge Criticality in Graph Domination. Graphs and Combinatorics 32, 801–811 (2016). https://doi.org/10.1007/s00373-015-1607-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-015-1607-5

Keywords