Determination and Testing the Domination Numbers of Tadpole Graph, Book Graph and Stacked Book Graph Using MATLAB

Section: Article
Issue
Vol. 10 No. 1 (2011): Volume 10 Issue 1
Published
Mar 1, 2011
Pages
491-504

Abstract

A set is said to be dominating set of G if for every
thereexistsavertex such that .Theminimum
cardinality of vertices among dominating set of G is called the
dominationnumberofGdenotedby .
WeinvestigatethedominationnumberofTadpolegraph,Bookgraphand
StackedBookgraph.Alsowetestour theoretical results incomputerby
introducing amatlab procedure to find the domination number ,
dominating set S and draw this graph that illustrates the vertices of
dominationthisgraphs.Itisprovedthat


S V G Dominating set v V-S uS uv . Domination number Domination . Domination number (Tadpole graph) (Book graph) (Stacked Book graph). (matlab) S : . there exists a vertex such that . The minimum cardinality of vertices among dominating set of G is called the domination number of G denoted by .We investigate the domination number of Tadpole graph, Book graph and Stacked Book graph. Also we test our theoretical results in computer by introducing a matlab procedure to find the domination number , dominating set S and draw this graph that illustrates the vertices of domination this graphs. It is proved that: .

References

  1. Alithani, S. Peng,Y. H. and Atan , K. A. M. 2008. "On the
  2. domination number of some graphs ", Int. Math. Forum, Vol. 3,
  3. No. 37-40, pp.1879-1884.
  4. Chartrand, G. and Lesniak, L. "Graphs and Digraphs", third
  5. addition , Chapman and Hall,(1996), chapter 10.
  6. Cooper,C. Klasing, R. and Zito, M. 2005." Lower Bounds and
  7. Algorithms for Dominating Sets in Web Graphs" ,Internet
  8. Math. Vol. 2, No. 3, pp.275-300.
  9. Erfang, S. , Liang, S.and Liying, K. 1998. "Some results on
  10. domination number of products of graphs", Applied
  11. Mathematics, Vol. 13, pp.103-108.
  12. Haynes, T. W. ; Hedetniemi, S. T. and Slater, P.J. 1998. "
  13. Fundamentals of
  14. Domination" in Graphs. Marcel Dekker, New York-Basel-Hong
  15. Kong.
  16. Hedetniemi, S.T. and Laskar, R.C.1991. "Topics on
  17. domination",North Holland
  18. February 15.
  19. Hurink, J. L. and Nieberg, T. 2008. "Approximating minimum
  20. independent dominating sets in wireless networks ", Information
  21. processing letters, Vol. 109, pp.155-160
  22. Kulli, V. R. and Janakiram, B. 2000. "The Nonsplit Domination
  23. Number of AGraph", Indian J. Pure Appl. Math. Vol. 31, No. 5,
  24. pp. 545-550
  25. Weisstein, E. W. 1999. "Tadpole Graph" From MathWorld-A
  26. Wolfram Wolfram Research, Inc., Available at:
  27. http://www.mathworld.wolfram.com/TadpoleGraph.html.
  28. Weisstein, E. W. 1999. "Book Graph" From MathWorld-A
  29. Wolfram Wolfram Research, Inc., Available at:
  30. http://mathworld.wolfram.com/BookGraph.html.
  31. Weisstein, E. W. 1999. "Stacked Book Graph" From MathWorld-A
  32. Wolfram Wolfram Research, Inc., Available at:
  33. http://www.mathworld.wolfram.com/Stacked BookGraph.html.
  34. Zmazek , B. and Žerovnik , J. 2005. "On domination numbers of
  35. graph bundles", Institute of mathematics, physics &mechanics,
  36. Preprint series, Vol. 43, pp.1-10.

Authors

Ayhan Ahmed khalil

Department of Artificial Intelligence Engineering Techniques

Omer Ahmed Khalil

University of Mosul / College of Education for Pure Sciences

Identifiers

https://doi.org/10.33899/berj.2011.Vol10.Iss1.38627
Download this PDF file
PDF

Statistics

How to Cite

Ayhan Ahmed khalil, & Omer Ahmed Khalil. (2011). Determination and Testing the Domination Numbers of Tadpole Graph, Book Graph and Stacked Book Graph Using MATLAB. College of Basic Education Research Journal, 10(1), 491–504. https://doi.org/10.33899/berj.2011.Vol10.Iss1.38627
Copyright and Licensing
Creative Commons License

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

Crossref
Scopus
Google Scholar
Europe PMC