Study on Gracefulness of Non-Connected Graph Kn,mυG

Yan Hua Yu; Xin Wang; Li Xia Song

doi:10.4028/www.scientific.net/AMM.278-280.1893

Paper Titles

The Path Planning Algorithm of Triangle Grid Scan for Localization in Wireless Sensor Network
p.1874

Large-Scale Electric Vehicle Operation Monitoring Platform Based on Cloud Computing
p.1878

Research and Design of Embedded Multi-Function CNC Platform Based on ARM
p.1883

Virtual Reality Applications IMU Wireless Sensors in the Lower Limbs Rehabilitation Training
p.1889

Study on Gracefulness of Non-Connected Graph K_n,mυG
p.1893

Research on the Significance, Measures and Steps of Constructing Knowledge Base of Regional Library in Poyang Lake
p.1897

Study on Scene Graph and its Application in Product Design
p.1901

Study on Universal Steganalysis for BMP Images Based on Multi-Domain Features
p.1906

Implementation of Symbolic Analysis of Mechatronic Systems
p.1910

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 278-280Study on Gracefulness of Non-Connected Graph...

Study on Gracefulness of Non-Connected Graph K_n,mυG

Abstract:

This paper works on the gracefulness of unconnected graphs. For the union-graphs of types of unconnected graphs, the conclusions are obtained as: for any positive integer m, n, assuming that G_{2n was a graceful graph edges at 2n, when 1≤n≤m , adhesive graph (Kn,m,G2n ) is a graceful graph; for any positive integer m,n,t where 1≤n≤m , and n≤t, unconnected graph Kn,mυ(G3}ν K_t)and K_n,mυ(P3ν K_t) are graceful graphs.

You might also be interested in these eBooks

Advances in Mechatronics and Control Engineering

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 278-280)

Pages:

1893-1896

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.278-280.1893

Citation:

Cite this paper

Online since:

January 2013

Authors:

Yan Hua Yu, Xin Wang, Li Xia Song

Keywords:

Graceful Graphs, Graceful Labe, Graphs, Unconnected Graph

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] H. cheng, b. yao, x. chen, z. zhang, on graceful generalized spiders and caterpillars, ars combin. vol 87, 2008, 181-191.

Google Scholar

[2] Y. Yang, X. Xu, Y. Xi, and H. Huijun, The graphs are graceful for. Ars Combin., 85 (2007) 361-368.

Google Scholar

[3] M. Z. Youssef, On Skolem-graceful and cordial graphs, Ars Combin., 78 (2006) 167~177.

Google Scholar

[4] Wei Li-Xia, et al: The researches on gracefilness of two kinds of unconnected graphs [J]. Journal of Shandong University (Natural Science) Vol43, 2008, 90-96.

Google Scholar

[5] WEI Li-xia, ZHANG Kun-long The Graceful Label of Several Kinds of join graph [J]. Journal of Zhongshan University (natural science), 2008, 42(3): 10~13.

Google Scholar

[6] Pan Wei, Lu Xian. The Gracefulness of Two Kinds of Unconnected Graph and [J]. Journal of Jilin University(Natural Science), 2003, 41(2): 152~154.

Google Scholar