(2,1)-Total Labelling of Trees

Hai Na Sun

doi:10.4028/www.scientific.net/KEM.474-476.2234

Paper Titles

Design and Implementation of Hainan Tourism Spots Virtual Reality System
p.2217

An Effective Genetic-Based Mathematical Computation Algorithm for Minimizing the Lennard-Jones Potential
p.2221

The Study on the Network Teaching Mode of Tourism Management in the Background of Hainan International Island Construction
p.2225

Application of Particle Swarm Optimization in Cylinder Helical HGearH Multi-Objective Design
p.2229

(2,1)-Total Labelling of Trees
p.2234

Research on Selecting Public Investment Project Based on a Decision Support System
p.2239

The Evaluation Model of the Hydropower Project Financing Risk Based on AHP-RS and RBF Neural Network
p.2243

Secure Range-Dependent Localization in Wireless Sensor Networks
p.2247

Assembly and Motion Simulation of Turntable of Drilling Rig Based on SolidWorks
p.2253

HomeKey Engineering MaterialsKey Engineering Materials Vols. 474-476(2,1)-Total Labelling of Trees

(2,1)-Total Labelling of Trees

Abstract:

Suppose thatis a tree with. We know that .is called type 1 ifand type 2 if. In this paper, we give a sufficient condition for a tree withto be type 1.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Key Engineering Materials (Volumes 474-476)

Pages:

2234-2238

DOI:

https://doi.org/10.4028/www.scientific.net/KEM.474-476.2234

Citation:

Cite this paper

Online since:

April 2011

Authors:

Hai Na Sun

Keywords:

L(2,1)-Total Labeling Tree, Maximum Degree, Sufficient Condition

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] W.K. Hale, Frequency assignment: theory and applications, Proc IEEE 68(1980), 1497-1514.

DOI: 10.1109/proc.1980.11899

Google Scholar

[2] J.R. Griggs and R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J Discrete Math 5(1992), 586-595.

DOI: 10.1137/0405048

Google Scholar

[3] F. Havet, total labelling of graphs, Workshop on Graphs and Algorithms, Dijon, France (2003).

Google Scholar

[4] F. Havet and M. -L. Yu, total labelling of graphs, Discrete Math, in press.

Google Scholar