Download PDF - Strongly multiplicative graphs
ArticleOriginal scientific text
Title
Strongly multiplicative graphs
Authors 1, 2
Affiliations
- Indiana University-Purdue University, Fort Wayne, Indiana 46805, USA
- Karnataka Regional Engineering College, Srinivasnagar, Karnataka - 574157, India
Abstract
A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1,2,...,p so that the values on the edges, obtained as the product of the labels of their end vertices, are all distinct. In this paper, we study structural properties of strongly multiplicative graphs. We show that all graphs in some classes, including all trees, are strongly multiplicative, and consider the question of the maximum number of edges in a strongly multiplicative graph of a given order.
Keywords
graph labelling, multiplicative labelling
Bibliography
- B.D. Acharya and S.M. Hegde, On certain vertex valuations of a graph, Indian J. Pure Appl. Math. 22 (1991) 553-560.
- G.S. Bloom, A chronology of the Ringel-Kotzig conjecture and the continuing quest to call all trees graceful, Ann. N.Y. Acad. Sci. 326 (1979) 32-51, doi: 10.1111/j.1749-6632.1979.tb17766.x.
- F.R.K. Chung, Labelings of graphs, Selected Topics in Graph Theory 3 (Academic Press, 1988) 151-168.
- P. Erdős, An asymptotic inequality in the theory of numbers, Vestnik Leningrad. Univ. 15 (1960) 41-49.
- J.A. Gallian, A dynamic survey of graph labeling, Electronic J. Comb. 5 (1998) #DS6.
- R.L. Graham and N.J.A. Sloane, On additive bases and harmonious graphs, SIAM J. Algebraic Discrete Methods 1 (1980) 382-404, doi: 10.1137/0601045.
- A. Rosa, On certain valuations of the vertices of a graph, in: Theory of Graphs, Internat. Symposium, Rome, July 1966 (Gordon and Breach, Dunod, 1967) 349-355.
Pages:
63-75
Main language of publication
English
Received
2000-08-09
Published
2001
DOI: 10.7151/dmgt.1133
Exact and natural sciences