IJPAM: Volume 80, No. 1 (2012)
ON
GRACEFULNESS OF
CROWNS
FOR COMPLETE BIPARTITE GRAPHS


FOR COMPLETE BIPARTITE GRAPHS
Deligen
, Lingqi Zhao
, Jirimutu
College of Mathematics
Inner Mongolian University for Nationalities
Tongliao, 028043, P.R. CHINA
College of Computer Science and Technology
Inner Mongolian University for Nationalities
Tongliao, 028043, P.R. CHINA




Inner Mongolian University for Nationalities
Tongliao, 028043, P.R. CHINA

Inner Mongolian University for Nationalities
Tongliao, 028043, P.R. CHINA
Abstract. Let denote a
crown of a complete bipartite graph
obtained by adding
hanged edges to each vertex of
. Ma kejie conjectured that 1-crown of complete bipartite graph
is
graceful graph for
. The conjecture has been shown true when
for arbitrary
and
. In this paper we discuss the
gracefulness of
crown
for complete bipartite graph
and prove the conjecture when
, for arbitrary
and
.
Received: March 12, 2012
AMS Subject Classification: 05C65
Key Words and Phrases: complete bipartite graph, graceful graph, graceful graph
Download paper from here.
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2012
Volume: 80
Issue: 1