One end node domination of Cartesian product of simple path semigraphs with ۱,۲ intermediate nodes

Domination concepts in graph theory, have various practical applications in real-world scenarios. In the context of networks, systems, and optimization, domination theory can offer several advantages. In communication or computer networks, domination can be used to optimize the placement of resources such as routers, servers, or communication hubs. A dominating set can represent a minimal number of resources needed to monitor or control the entire network. In this paper, ۱e-domination number of the Cartesian product of elementary semigraphs with one and two intermediate nodes are discussed.

کلیدواژه ها:

Semigraph ، Path Semigraph ، Cartesian product ، ۱e-Dominating set ، ۱e-Domination number