Graceful Labeling of the Unconnected Graph D_(2,6)∪G
WU Yue-shen
Abstract
WU Yue-shen
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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