Some Dominating Applications on Discrete Topological Graphs

Authors

  • Zahraa M. Kalil Department of Mathematics, College of Education for Pure Sciences University of Thi-Qar, Thi-Qar, Iraq
  • Mohammed A. Abdlhusein College of Education for WomenShatrah University, Thi-Qar,Iraq
  • Mohammad R. Farahani Department of Mathematics and Computer Sciences Iran University of Science and Technology (IUST), Narmak, Tehran 16844, Iran
  • Mohammad R. Farahani Department of Mathematics and Computer Sciences Iran University of Science and Technology (IUST), Narmak, Tehran 16844, Iran

DOI:

https://doi.org/10.32792/jeps.v15i1.678

Abstract

In this paper several types of dominating parameters are applied on a  discrete topological graph ) created from the topological space ), where  is the set of vertices in  that includes all subset of  unless  , , and  is a set of edges between any two vertices in which any two vertices in  such that . Some dominating parameters on  are studied such as: general domination, connected domination, doubly connected domination, and polynomial domination. Besides the minimum dominating set is proved for any topological graph formed by corona operation or join operation between two topological graphs. Also, the inverse domination is discussed.

Downloads

Published

2025-03-01