Leaf Domination of Graphs

Authors

  • Dr. B.K. Keerthiga Priyatharsini Assistant Professor (Sr. Gr. ), Department of Mathematics, University College of Engineering, Ramanathapuram Author
  • Mrs. G. Uma Assistant Professor, Department of Mathematics, University College of Engineering, Dindigul Author

Keywords:

Domination Number, Isolate Domination, Wheel graph, Ladder graph, Pan graph

Abstract

Let  be connected graph. A dominating set  in   is said to be a leaf dominating set if  must have at least one leaf vertex. The least number of a leaf dominating set is said to be leaf domination number, represented by  Any minimal dominating set with the least amount of cardinality is called the                   set. In this work, we determine leaf domination number and calculate leaf domination number for standard graphs.

Downloads

Published

2024-01-12

Issue

Vol. 3 No. 1 (2024): January 2024

Section

Articles

License

Copyright (c) 2024 International Journal of Scientific Research in Modern Science and Technology

Creative Commons License

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

How to Cite

Leaf Domination of Graphs. (2024). International Journal of Scientific Research in Modern Science and Technology, 3(1), 07-12. https://ijsrmst.com/index.php/ijsrmst/article/view/169