IJPAM: Volume 31, No. 3 (2006)
ON THE VERTEX-DISTINGUISHING EDGE COLORING
OF
OF

Jingwen Li
, Donghan Zhang
School of Information and Electrical Engineering
Lanzhou Jiaotong University
Lanzhou, 730000, P.R. CHINA
School of Mathematics and Software Engineering
Lanzhou Jiaotong University
Lanzhou, 730000, P.R. CHINA
e-mail: zhang_gao227@yahoo.com.cn



Lanzhou Jiaotong University
Lanzhou, 730000, P.R. CHINA

Lanzhou Jiaotong University
Lanzhou, 730000, P.R. CHINA
e-mail: zhang_gao227@yahoo.com.cn
Abstract.Let be a connected graph. A
-proper edge coloring
of
is said to be a
-vertex-distinguishing edge coloring iff
for
,
, where
; and
is called the vertex-distinguishing edge chromatic number. In this paper, we obtain the vertex-distinguishing edge chromatic number of the join graphs
.
Received: July 28, 2006
AMS Subject Classification: 05C15, 68R10
Key Words and Phrases: star, balanced complete bipartite graph, join-graph, vertex-distinguishing edge chromatic number
Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2006
Volume: 31
Issue: 3