2014Hainan Daxue xuebao. Ziran kexue banRequires access

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

WU Yue-shen

Open publisher page 0 citations

Abstract

In the report,the gracefulness of the unconnected graph D2,6∪G was discussed. One sufficient condition was proposed for the gracefulness of unconnected graph D2,6∪G. It was proved that if G is balanced bipartite graph with certain conditions,the unconnected graph D2,6∪G is graceful graph.

About this research paper

What this paper is about

In the report,the gracefulness of the unconnected graph D2,6∪G was discussed. One sufficient condition was proposed for the gracefulness of unconnected graph D2,6∪G. It was proved that if G is balanced bipartite graph with certain conditions,the unconnected graph D2,6∪G is graceful graph.

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

In the report,the gracefulness of the unconnected graph D2,6∪G was discussed. One sufficient condition was proposed for the gracefulness of unconnected graph D2,6∪G. It was proved that if G is balanced bipartite graph with certain conditions,the unconnected graph D2,6∪G is graceful graph.

Key concepts: Edge-transitive graph, Windmill graph, Combinatorics, Graph, Mathematics, Voltage graph, Graph power, Simplex graph

Related papers

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