ScholarLens Back to search
2014•Unpublished venueRequires access

The Graceful Labeling of the Unconnected Graph D_(2,8)∪G

WU Yue-shen

Open publisher page 0 citations

Abstract

The gracefulness of the unconnected graph F2,8∪G is discussed. Four sufficient conditions are given for the gracefulness of unconnected graph D2,8∪G.

About this research paper

What this paper is about

The gracefulness of the unconnected graph F2,8∪G is discussed. Four sufficient conditions are given for the gracefulness of unconnected graph D2,8∪G.

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

The gracefulness of the unconnected graph F2,8∪G is discussed. Four sufficient conditions are given for the gracefulness of unconnected graph D2,8∪G.

Key concepts: Computer science, Graph, Combinatorics, Business, Mathematics, Theoretical computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Graceful Labeling of the Unconnected Graph D_(2,8)∪G — Research Paper | ScholarLens