Forcing Independent Domination Number of a Graph

Authors

DOI:

https://doi.org/10.29020/nybg.ejpam.v12i4.3484

Keywords:

domination, forcing, independent, join, corona, lexicographic product

Abstract

In this paper, we obtain the forcing independent domination number of some special graphs. Further, we determine the forcing independent domination number of graphs  under some binary operations such join, corona and lexicographic product of two graphs.

Author Biographies

  • Cris Laquibla Armada, Cebu Normal University
    Instructor I, Mathematics Department, College of Arts and Sciences, Cebu Normal University
  • Sergio, Jr. R. Canoy, Mindanao State University-Iligan Institute of Technology

    Professor VI, Department of Mathematics and Statistics,

    College of Sciences and Mathematics

Downloads

Published

2019-10-31

Issue

Vol. 12 No. 4: (October 2019)

License

Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.

European Journal of Pure and Applied Mathematics will be Copyright Holder.

How to Cite

Forcing Independent Domination Number of a Graph. (2019). European Journal of Pure and Applied Mathematics, 12(4), 1371-1381. https://doi.org/10.29020/nybg.ejpam.v12i4.3484