ScholarLens Back to search
2012•Journal of Science of Teachers' College and UniversityRequires access

On the Gracefulness of Graph P_(6k+1)~3∪P_n~3

WU Yue-sheng

Open publisher page 0 citations

Abstract

Discussed the gracefulness of disconnected graph P_(6k)~3∪P_n~3,gave the graceful labelings by construction method.Also proved that union graph of P_(6k)~3∪P_n~3 are alternating graph.

About this research paper

What this paper is about

Discussed the gracefulness of disconnected graph P_(6k)~3∪P_n~3,gave the graceful labelings by construction method.Also proved that union graph of P_(6k)~3∪P_n~3 are alternating 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

Discussed the gracefulness of disconnected graph P_(6k)~3∪P_n~3,gave the graceful labelings by construction method.Also proved that union graph of P_(6k)~3∪P_n~3 are alternating graph.

Key concepts: Graph, Combinatorics, Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the Gracefulness of Graph P_(6k+1)~3∪P_n~3 — Research Paper | ScholarLens