An upper bound for domination number of 5-regular graphs

Title:

An upper bound for domination number of 5-regular graphs

Creator:

Xing, Hua-Ming, Sun, Liang, and Chen, Xue-Gang

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:2271a465-93ed-4bc4-894b-6704a0fc1126
uuid:2271a465-93ed-4bc4-894b-6704a0fc1126

Subject:

domination number, 5-regular graph, and upper bounds

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

Let $G=(V, E)$ be a simple graph. A subset $S\subseteq V$ is a dominating set of $G$, if for any vertex $u\in V-S$, there exists a vertex $v\in S$ such that $uv\in E$. The domination number, denoted by $\gamma (G)$, is the minimum cardinality of a dominating set. In this paper we will prove that if $G$ is a 5-regular graph, then $\gamma (G)\le {5\over 14}n$.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

1049-1061

Source:

Czechoslovak Mathematical Journal | 2006 Volume:56 | Number:3

Harvested from:

CDK

Metadata only:

false