• Tidak ada hasil yang ditemukan

LIVING WITH THE LABELING DISEASE FOR 25 YEARS | Gallian | Journal of the Indonesian Mathematical Society 18 71 1 PB

N/A
N/A
Protected

Academic year: 2017

Membagikan "LIVING WITH THE LABELING DISEASE FOR 25 YEARS | Gallian | Journal of the Indonesian Mathematical Society 18 71 1 PB"

Copied!
1
0
0

Teks penuh

(1)

J. Indones. Math. Soc.

Special Edition (2011), pp. 45–58.

LIVING WITH THE LABELING DISEASE FOR 25

YEARS

Joseph A. Gallian

Department of Mathematics and Statistics

University of Minnesota Duluth, Duluth, MN 55812, USA

Abstract.In this article I trace my involvement with graph labeling for the past 25 years. I provide some statistical information about the growth in interest in graph labeling and some open problems that I believe are accessible.

Key words: Graph labeling, graceful graphs, harmonious graphs.

Referensi

Dokumen terkait

The aim of this article is a survey of the research of Morrey spaces with non- doubling measures. This article is based on the lecture delivered in

Much evidence has been produced in support of the conjecture (see Gallian [2]), the majority of which falls under the “Here is another family of graceful trees” or “Trees of this

By Theorem 2.3, the remaining unlabeled edges of our graph can be labeled in any assortment and, as long as the labeling is friendly, it yields the highest edge- balance

In this section, we present different lemmas related to lower and upper bounds of the magic constant a for various subclasses of subdivided stars.... Ngurah

Motivated by this paper, we introduced the concept of minimum dominating dis- tance energy E Dd ( G ) of a graph G and computed minimum dominating distance energies of a star

In this paper we have computed minimum covering Seidel energies of a star graph, complete graph, crown graph, complete bipartite graph and cocktail party graphs.. Upper and lower

In this research paper, We have introduced the idea of bipolar single-valued neutrosophic graph structure and discussed many relevant notions.. We also discussed a

To investigate the nicely 2-distance-balanced property of the Cartesian prod- uct of graphs, we observe that using this kind of graph product with N2DB graphs cannot be generated a