Kn-Dominating Function in Graph Theory

Authors

  • K. Hari Prakash  M.Sc., Department of Mathematics, Dr. SNS Rajalakshmi College of Arts and Science (Autonomous), Coimbatore, Tamil Nadu, India
  • M. MuthuSelvi  M.Sc., M.Phil., Assistant Professor, Department of Mathematics, Dr. SNS Rajalakshmi College of Arts and Science (Autonomous), Coimbatore, Tamil Nadu, India

Keywords:

Graph theory, Kn-Dominating set, Minimal Kn-Dominating set, Dominating Function.

Abstract

Graph theory is a branch of Discrete Mathematics. Graph theory is the study of graphs which are mathematical structures used to model pair wise relations between objects. This paper deals with the basic definition of dominating sets in graph theory and theorem has been explained regarding dominating function.

References

  1. J. A. Bondy and U.S.R.Murty; "Graph Theory with Applications", Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada.
  2. F.Harary, GraphTheory, Narosa Publishing House,(2013).
  3. C. Berge, Theory of Graphs and its Applications Methuen, London, 1962.
  4. Jennifer M. Tarr, Domination in graphs, University of South Florida.
  5. E. J. Cockayne and S. T. Hedetniemi, Towards a theory of domination in graphs, Networks 7 (1977) 247-261.
  6. W. Haynes, S. T. Hedetniemi, and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2017-10-31

Issue

Volume 3, Issue 6, September-October-2017

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
K. Hari Prakash, M. MuthuSelvi "Kn-Dominating Function in Graph Theory" International Journal of Scientific Research in Science, Engineering and Technology (IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 3, Issue 6, pp.342-343, September-October-2017.