2007Jilin Normal University JournalRequires access

On the Gracefulness of Graph St∪ from i=1 to n m_i-C_4

Guoyang Zhang

Open publisher page 0 citations

Abstract

We present a kind of disconnected graph the union of star St and graph m-C4,and have proved that graph Stp∪m-C4 is a graceful graph when m≥2.We have proved that the union of star St and graph ∪from i=1 to n mi-C4 graph St∪from i=1 to n mi-C4 is a graceful graph when max mi≥3(i=1,2,…,n).

About this research paper

What this paper is about

We present a kind of disconnected graph the union of star St and graph m-C4,and have proved that graph Stp∪m-C4 is a graceful graph when m≥2.We have proved that the union of star St and graph ∪from i=1 to n mi-C4 graph St∪from i=1 to n mi-C4 is a graceful graph when max mi≥3(i=1,2,…,n).

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

We present a kind of disconnected graph the union of star St and graph m-C4,and have proved that graph Stp∪m-C4 is a graceful graph when m≥2.We have proved that the union of star St and graph ∪from i=1 to n mi-C4 graph St∪from i=1 to n mi-C4 is a graceful graph when max mi≥3(i=1,2,…,n).

Key concepts: Windmill graph, Combinatorics, Voltage graph, Butterfly graph, Graph, Null graph, Distance-regular graph, Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
On the Gracefulness of Graph St∪ from i=1 to n m_i-C_4 — Research Paper | ScholarLens