# On Domination Number of 4-Regular Graphs

@article{Liu2004OnDN, title={On Domination Number of 4-Regular Graphs}, author={Hailong Liu and Liang Sun}, journal={Czechoslovak Mathematical Journal}, year={2004}, volume={54}, pages={889-898} }

- Published 2004
DOI:10.1007/s10587-004-6438-0

Let G be a simple graph. A subset S ⫅ V is a dominating set of G, if for any vertex v ∈ V – S there exists a vertex u ∈ S such that uv ∈ E(G). The domination number, denoted by γ(G), is the minimum cardinality of a dominating set. In this paper we prove that if G is a 4-regular graph with order n, then γ(G) ≤ 4/11n

#### Citations

##### Publications citing this paper.

SHOWING 1-3 OF 3 CITATIONS

## TWO REMARKS ON THE DOMINATION NUMBER OF GRAPHS

VIEW 1 EXCERPT

## Dominating sets in Kneser graphs

VIEW 2 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-3 OF 3 REFERENCES

## Fundamentals of domination in graphs

VIEW 3 EXCERPTS

## Domination in graphs with minimum degree two

VIEW 3 EXCERPTS