Work

Domination number on an octagonal chain and an octagonal grid

Year: 2024

Type: article

Abstract: UDC 519.1 Domination of the graph and topological indices are essential topics in the graph theory. We analyze the problem of $k$-domination, $k\in\{1,2,3\}$, on octagonal chains and an octagonal grid. We determine the minimal $k$-dominating sets and $k$-domination $k$ numbers for a chain of octagons with two common vertices. By using the obtained results, we determine the $k$-domination numbers for the grid of octagons $O_{mxn}$ with $m,n\in N$.

Source: Ukrains’kyi Matematychnyi Zhurnal

DOI: 10.3842/umzh.v76i12.7995

Author: Miroslava Mihajlov Carević

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4405950251

FWCI:

Cites: 20

Cited by:

Related to: 10