Skip to main content
SpringerLink
Log in

On domination related concepts in Graph Theory

  • Contributed Papers
  • Conference paper
  • First Online:
Combinatorics and Graph Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 885))

Abstract

A survey of recent results on domination and related concepts in graph theory is presented.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B.D. Acharya and H.B. Walikar, On the graphs having unique minimum dominating sets, Abstract No. 2, Graph Theory Newsletter, 8(15), (1979), 1.

    Google Scholar 

  2. R.B. Allan and R. Laskar, On domination and independent domination numbers of a graph, Discrete Math., No. 2, 23 (1978), 73–76.

    Article  MathSciNet  MATH  Google Scholar 

  3. R.B. Allan and R. Laskar, On domination and some related topics in graph theory, Proc. of Ninth S.E. Conference on Combinatorics, Graph Theory and Computing, Utilitas Math., (1979), 43–56.

    Google Scholar 

  4. R.B. Allan and R. Laskar, S.T. Hedetniemi, On the total domination of a graph. To appear.

    Google Scholar 

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

    MATH  Google Scholar 

  6. C. Benzaken, and P.L. Hammer, Linear separation of dominating sets in graphs, Annals of Discrete Math., Vol. 3, 1978.

    Google Scholar 

  7. B. Bollabas, and E.J. Cockayne, Graph theoretic parameters concerning domination, independence and irredundance, J. Graph Theory (to appear).

    Google Scholar 

  8. V. Chvatal, and P.L. Hammer, Set packing problems and threshold graphs, Annals of Discrete Math., Vol. 1, 1977.

    Google Scholar 

  9. E.J. Cockayne and S.T. Hedetniemi, Towards a theory of domination in graphs, Networks, Fall 1977, 247–271.

    Google Scholar 

  10. E.J. Cockayne and S.T. Hedetniemi, Independence graphs, Proc. of Fifth S.E. Conference on Combinatorics, Graph Theory and Computing, Utilitas Math., (1974), 471–491.

    Google Scholar 

  11. E.J. Cockayne and S.T. Hedetniemi, Disjoint independent dominating sets in graphs, Discrete Math., 15 (1976), 213–222.

    Article  MathSciNet  MATH  Google Scholar 

  12. E.J. Cockayne and S.T. Hedetniemi, Total domination in graphs. To appear.

    Google Scholar 

  13. E.J. Cockayne and A.G. Thomason, Contributions to the theory of domination, independence and irredundance in graphs, Research Report, University of Victoria, April 1979.

    Google Scholar 

  14. E.J. Cockayne, Domination of undirected graphs: A survey; in “Theory and Applications of Graphs”, (Proc. International Conf., Western Michigan Univ., Kalamazoo, Michigan 1976), Lecture Notes in Math., 642 (1978), 141–147, Springer Verlag, Berlin.

    MATH  Google Scholar 

  15. D.A. Drake and J.W. Freeman, Partial t-spreads and group constructible (s,r,μ)-nets (preprint).

    Google Scholar 

  16. J. Edmonds and D.R. Fulkerson, Bottleneck extrema, J. Comb. Theory, 8 (1970), 299–306.

    Article  MathSciNet  MATH  Google Scholar 

  17. T. Hamanda and I. Yoshimura, Traversability and connectivity of the middle graph of graph, Discrete Math., 14 (1976) 247–255.

    Article  MathSciNet  MATH  Google Scholar 

  18. F. Harary, Graph Theory, Addison Wesley, 1972.

    Google Scholar 

  19. F. Jaegar and C. Payan, Relations der type Nordhaus-Gaddum pour le nombre d’absorption d’un graphe simple, C.R. Acad. Sc. Series A, Paris, 274 (1972). 728–730.

    MATH  Google Scholar 

  20. J.G. Kalbflisch, R. Stanton, J.D. Horton, On covering sets and error correcting codes, J. Comb. Th., 11A (1971), 233–250.

    Article  MathSciNet  MATH  Google Scholar 

  21. C.L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, N.Y., 1968.

    MATH  Google Scholar 

  22. A. Meir and J.W. Moon, Relations between packing and covering numbers of a tree, Pac. J. Math., 61 (1975), 225–233.

    Article  MathSciNet  MATH  Google Scholar 

  23. S. Mitchell and S.T. Hedetniemi, Independent domination in trees, Proc. Eighth S.E. Conference on Combinatorics, Graph Theory and Computing, (1977), 489–509.

    Google Scholar 

  24. J. Nieminen, Two bounds for the domination number of a graph, J. Inst. Math. Applics., 14 (1974), 183–187.

    Article  MathSciNet  MATH  Google Scholar 

  25. O. Ore, Theory of Graphs, Amer. Math. Soc. Colloq. Publ., 38, Providence, 1962.

    Google Scholar 

  26. E. Sampathkumar and H.B. Walikar, Some bounds on the connected domination number of a graph. (Preprint).

    Google Scholar 

  27. D. Sumnar and John I. Moore, Jr., Notices, AMS., Oct. 1979, A-569.

    Google Scholar 

  28. V.G. Vizing, A bound on the external stability number of a graph, Doklady A.N., 169, (1965), 729–731.

    MathSciNet  Google Scholar 

  29. H.B. Walikar, E. Sampathkumar and B.D. Acharya, Two new bounds for the domination number of a graph. (Preprint).

    Google Scholar 

  30. H.B. Walikar, B.D. Acharya and E. Sampathkumar, Recent developments in the theory of domination in graphs and its applications, MRI, Lecture Notes in Math., No. 1, 1978.

    Google Scholar 

  31. H.B. Walikar, On star-partition number of a graph. (Preprint).

    Google Scholar 

  32. H.B. Walikar, B.D. Acharya and E. Sampathkumar, On an extremal problem concerning a Nordhaus-Gaddum type result in the theory of domination in graphs. (Preprint).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Clemson University, 29631, Clemson, S.C., U.S.A.

    Renu Laskar

  2. Karnatak Arts College, 580 001, Dharwar, India

    H. B. Walikar

Authors
  1. Renu Laskar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. B. Walikar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Siddani Bhaskara Rao

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Laskar, R., Walikar, H.B. (1981). On domination related concepts in Graph Theory. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092276

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11151-1

  • Online ISBN: 978-3-540-47037-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation