ArticleOriginal scientific text
Title
A note on strongly multiplicative graphs
Authors 1, 1, 1
Affiliations
- Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysore - 570 006, INDIA
Abstract
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].
Keywords
graph labeling, strongly multiplicative graphs
Bibliography
- L.W. Beineke and S.M. Hegde, Strongly multiplicative graphs, Discuss. Math. Graph Theory 21 (2001) 63-76, doi: 10.7151/dmgt.1133.
- P. Erdős, An asymptotic inequality in the theory of numbers, Vestnik Leningrad, Univ. 15 (1960) 41-49.
Pages:
81-83
Main language of publication
English
Received
2001-10-24
Accepted
2002-07-06
Published
2004
DOI: 10.7151/dmgt.1215
Exact and natural sciences