Download PDF - An upper bound for maximum number of edges in a strongly multiplicative graphAll rights reserved. Copyright exceptions and limitations apply

ArticleOriginal scientific text

Title

An upper bound for maximum number of edges in a strongly multiplicative graph

Authors 1, 2

Affiliations

  1. Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysore-570006, India
  2. Department of Mathematics, Sri Jayachamarajendra College of Engineering, Mysore-570006, 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 bounds given by Beineke and Hegde [3] and Adiga, Ramaswamy and Somashekara [2], for n ≥ 28.

Keywords

ENG
graph labelling, strongly multiplicative graphs

Bibliography

  1. C. Adiga, H.N. Ramaswamy and D.D. Somashekara, On strongly multiplicative graphs, South East Asian J. Math. & Math. Sc. 2 (2003) 45-47.
  2. C. Adiga, H.N. Ramaswamy and D.D. Somashekara, A note on strongly multiplicative graphs, Discuss. Math. Graph Theory 24 (2004) 81-83, doi: 10.7151/dmgt.1215.
  3. L.W. Beineke and S.M. Hegde, Strongly multiplicative graphs, Discuss. Math. Graph Theory 21 (2001) 63-76, doi: 10.7151/dmgt.1133.
  4. P. Erdős, An asymptotic inequality in the theory of numbers, Vestnik Leningrad. Univ. 15 (1960) 41-49.
Discussiones Mathematicae Graph Theory
2006/26/2
Export to PBN, Opens in new tab
Pages:
225-229
Main language of publication
English
Received
2005-08-18
Accepted
2005-12-29
Published
2006

DOI: 10.7151/dmgt.1315

Exact and natural sciences