17
Views
2
CrossRef citations to date
0
Altmetric
Articles

Construction of Halin graph with perfect k-ary tree and its independent domination number

&
Pages 1101-1106 | Received 01 Apr 2019, Published online: 11 Dec 2019

References

  • Allan R.B. and R. Laskar, On domination and independent domina­tion numbers of a graph, Discrete Math., 23, pp. 73-76, (1978). doi: 10.1016/0012-365X(78)90105-X
  • Anandhababu D., and N. Parvathi, On independent domination number of Indubala product of some families of graphs, AIP Confer­ence Proceedings, 2112, 020139 (2019). doi: 10.1063/1.5112324
  • Berge C., Theory of Graphs and its Applications, Methuen, London, (1962).
  • Chaluvaraju B., and N. D. Soner, Complementary total domination in graphs, Journal of discrete mathematical sciences and cryptography, 10.4, pp. 505-516, (2007). doi: 10.1080/09720529.2007.10698135
  • Cockayne E.J. and C.M. Mynhardt. The sequence of upper and lower domination, Independence and irredundance numbers of a graph, Discrete Math.,122, pp. 89-102, (1993). doi: 10.1016/0012-365X(93)90288-5
  • Favaron O., A bound on the independent domination number of a tree. Vishwa Internat. J. Graph Theory, 1, pp. 19-27, (1992).
  • Haynes T.W., Hedetniemi S.T., and P.J. Slater, Fundamentals of Domi­nation in Graphs. Marcel Dekker Inc., New York, (1998).
  • Harary F., and M. Livingston. Characterization of trees with equal domination and independent domination numbers, Congr. Numer, 55, pp. 121-150, (1986).
  • Hong Yang and Xiujun Zhang, The independent domination num­bers of strong product of two cycles, Journal of discrete mathematical sciences and cryptography, 21(7-8), pp. 1495-1507, (2018).
  • Irving R.W., On approximating the minimum independent dominat­ing set, Inform. Process. Lett., 37, pp. 197-200, (1991). doi: 10.1016/0020-0190(91)90188-N
  • Priyadharshini M., Anandha Babu D., Anuradha A., To appear in The Journal of Combinatorial Mathematics and Combinatorial Computing, (2019).
  • Wayne Goddard, Michael A., Henning Independent domination in graphs: A survey and recent results, Discrete Mathematics, 313.7, pp. 839-854, (6 April 2013). doi: 10.1016/j.disc.2012.11.031

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.