Forcing Subsets for γc-sets and γt-sets in the Lexicographic Product of Graphs

Authors

  • Cris Laquibla Armada Cebu Normal University https://orcid.org/0000-0002-4385-4802
  • Sergio, Jr. R. Canoy Mindanao State University-Iligan Institute of Technology
  • Carmelito E. Go Mindanao State University-Main Campus

DOI:

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

Keywords:

connected domination, total domination, forcing subset, lexicographic product

Abstract

In this paper, the connected dominating sets and total dominating sets in the lexicographic product of two graphs are characterized. Further, the connected domination, total domination, forcing connected domination and forcing total domination numbers of these graphs are determined.

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

  • Carmelito E. Go, Mindanao State University-Main Campus
    Professor, Department of Mathematics, College of Natural Sciences and Mathematics

Downloads

Published

2019-10-31

Issue

Vol. 12 No. 4: (October 2019)

Section

Nonlinear Analysis

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 Subsets for γc-sets and γt-sets in the Lexicographic Product of Graphs. (2019). European Journal of Pure and Applied Mathematics, 12(4), 1779-1786. https://doi.org/10.29020/nybg.ejpam.v12i4.3485

Similar Articles

1-10 of 241

You may also start an advanced similarity search for this article.