ScholarLens Back to search
2004•Journal of Langfang Teachers CollegeRequires access

Upper Bounds for the Domination Number of a Kind of Graphs

Huaming Xing

Open publisher page 0 citations

Abstract

This paper proves that if a graph G of order n with minimum degree at least four has a Hamiltonian cycle, the domination number of G is at most 4n/11.

About this research paper

What this paper is about

This paper proves that if a graph G of order n with minimum degree at least four has a Hamiltonian cycle, the domination number of G is at most 4n/11.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper proves that if a graph G of order n with minimum degree at least four has a Hamiltonian cycle, the domination number of G is at most 4n/11.

Key concepts: Domination analysis, Mathematics, Combinatorics, Upper and lower bounds, Dominating set, Discrete mathematics, Computer science, Graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Upper Bounds for the Domination Number of a Kind of Graphs — Research Paper | ScholarLens